java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:32:31,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:32:31,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:32:31,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:32:31,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:32:31,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:32:31,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:32:31,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:32:31,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:32:31,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:32:31,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:32:31,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:32:31,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:32:31,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:32:31,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:32:31,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:32:31,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:32:31,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:32:31,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:32:31,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:32:31,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:32:31,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:32:31,441 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:32:31,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:32:31,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:32:31,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:32:31,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:32:31,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:32:31,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:32:31,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:32:31,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:32:31,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:32:31,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:32:31,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:32:31,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:32:31,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:32:31,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:32:31,478 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:32:31,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:32:31,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:32:31,479 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:32:31,479 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:32:31,479 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:32:31,480 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:32:31,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:32:31,480 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:32:31,480 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:32:31,480 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:32:31,481 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:32:31,481 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:32:31,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:32:31,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:32:31,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:32:31,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:32:31,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:32:31,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:32:31,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:32:31,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:32:31,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:32:31,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:32:31,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:32:31,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:32:31,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:32:31,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:32:31,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:32:31,485 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:32:31,486 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:32:31,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:32:31,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:32:31,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:32:31,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:32:31,556 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:32:31,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_false-unreach-call1.i [2018-11-12 20:32:31,618 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de91af04/b4f3938d0e3a4f808f1dc972df920f67/FLAG25c1dec6e [2018-11-12 20:32:32,066 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:32:32,068 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_false-unreach-call1.i [2018-11-12 20:32:32,075 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de91af04/b4f3938d0e3a4f808f1dc972df920f67/FLAG25c1dec6e [2018-11-12 20:32:32,095 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de91af04/b4f3938d0e3a4f808f1dc972df920f67 [2018-11-12 20:32:32,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:32:32,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:32:32,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:32:32,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:32:32,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:32:32,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1448308a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32, skipping insertion in model container [2018-11-12 20:32:32,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:32:32,150 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:32:32,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:32:32,331 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:32:32,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:32:32,364 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:32:32,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32 WrapperNode [2018-11-12 20:32:32,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:32:32,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:32:32,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:32:32,366 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:32:32,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:32:32,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:32:32,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:32:32,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:32:32,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... [2018-11-12 20:32:32,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:32:32,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:32:32,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:32:32,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:32:32,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:32:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:32:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:32:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:32:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:32:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:32:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:32:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:32:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:32:32,766 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:32:32,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:32:32 BoogieIcfgContainer [2018-11-12 20:32:32,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:32:32,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:32:32,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:32:32,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:32:32,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:32:32" (1/3) ... [2018-11-12 20:32:32,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c051a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:32:32, skipping insertion in model container [2018-11-12 20:32:32,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:32:32" (2/3) ... [2018-11-12 20:32:32,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c051a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:32:32, skipping insertion in model container [2018-11-12 20:32:32,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:32:32" (3/3) ... [2018-11-12 20:32:32,777 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_false-unreach-call1.i [2018-11-12 20:32:32,787 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:32:32,795 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:32:32,812 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:32:32,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:32:32,852 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:32:32,852 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:32:32,852 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:32:32,852 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:32:32,852 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:32:32,853 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:32:32,853 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:32:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-12 20:32:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-12 20:32:32,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:32,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:32,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:32,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-12 20:32:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:32,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:32,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:32,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:33,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:32:33,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:32:33,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:32:33,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:32:33,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:32:33,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:32:33,031 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-12 20:32:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:33,054 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-12 20:32:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:32:33,055 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-12 20:32:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:33,064 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:32:33,065 INFO L226 Difference]: Without dead ends: 13 [2018-11-12 20:32:33,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:32:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-12 20:32:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-12 20:32:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-12 20:32:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-12 20:32:33,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-12 20:32:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:33,110 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-12 20:32:33,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:32:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-12 20:32:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-12 20:32:33,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:33,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:33,111 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:33,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-12 20:32:33,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:33,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:33,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:33,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:33,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:32:33,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:32:33,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:32:33,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:32:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:32:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:32:33,292 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-12 20:32:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:33,377 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-12 20:32:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:32:33,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-12 20:32:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:33,379 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:32:33,379 INFO L226 Difference]: Without dead ends: 16 [2018-11-12 20:32:33,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:32:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-12 20:32:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-12 20:32:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-12 20:32:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-12 20:32:33,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-12 20:32:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:33,386 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-12 20:32:33,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:32:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-12 20:32:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:32:33,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:33,387 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:33,388 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:33,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-12 20:32:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:33,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:33,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:33,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:33,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:33,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-12 20:32:33,523 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:32:33,556 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:32:33,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:32:33,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:32:33,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:32:33,877 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Performed 164 root evaluator evaluations with a maximum evaluation depth of 6. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-12 20:32:33,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:33,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:32:33,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:33,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:33,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:33,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:34,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 20:32:34,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:34,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:32:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:32:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:32:34,125 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-12 20:32:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:34,206 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-12 20:32:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:32:34,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-12 20:32:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:34,207 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:32:34,208 INFO L226 Difference]: Without dead ends: 19 [2018-11-12 20:32:34,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:32:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-12 20:32:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-12 20:32:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-12 20:32:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-12 20:32:34,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-12 20:32:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:34,215 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-12 20:32:34,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:32:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-12 20:32:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-12 20:32:34,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:34,216 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:34,216 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-12 20:32:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:34,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:34,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:34,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:34,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:34,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:34,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:34,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:34,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:34,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:32:34,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:34,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:32:34,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:32:34,714 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:32:34,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-12 20:32:34,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:32:34,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:32:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:32:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:32:34,716 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-12 20:32:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:34,753 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-12 20:32:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:32:34,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-12 20:32:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:34,756 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:32:34,756 INFO L226 Difference]: Without dead ends: 22 [2018-11-12 20:32:34,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:32:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-12 20:32:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-12 20:32:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:32:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-12 20:32:34,764 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-12 20:32:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:34,764 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-12 20:32:34,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:32:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-12 20:32:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:32:34,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:34,766 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:34,767 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-12 20:32:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:34,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:34,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:34,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:34,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:34,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-12 20:32:34,962 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-12 20:32:34,964 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:32:34,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:32:34,968 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:32:35,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:32:35,094 INFO L272 AbstractInterpreter]: Visited 14 different actions 78 times. Merged at 5 different actions 30 times. Widened at 2 different actions 4 times. Performed 202 root evaluator evaluations with a maximum evaluation depth of 6. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-12 20:32:35,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:35,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:32:35,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:35,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:35,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:35,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:35,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:36,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:36,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-12 20:32:36,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:36,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:32:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:32:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:32:36,121 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-12 20:32:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:36,206 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-12 20:32:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:32:36,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:32:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:36,207 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:32:36,207 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:32:36,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:32:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:32:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-12 20:32:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-12 20:32:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-12 20:32:36,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-12 20:32:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:36,214 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-12 20:32:36,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:32:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-12 20:32:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:32:36,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:36,215 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:36,216 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:36,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-12 20:32:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:36,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:36,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:36,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:36,558 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:36,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:36,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:36,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:36,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:36,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:32:36,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:36,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:32:36,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:32:37,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:37,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-12 20:32:37,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:37,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:32:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:32:37,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:32:37,074 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-12 20:32:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:37,302 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-12 20:32:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:32:37,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-12 20:32:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:37,304 INFO L225 Difference]: With dead ends: 44 [2018-11-12 20:32:37,304 INFO L226 Difference]: Without dead ends: 34 [2018-11-12 20:32:37,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:32:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-12 20:32:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-12 20:32:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:32:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-12 20:32:37,312 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-12 20:32:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:37,312 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-12 20:32:37,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:32:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-12 20:32:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:32:37,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:37,314 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:37,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:37,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-12 20:32:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:37,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:37,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:37,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:37,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:37,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:37,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:37,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:37,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:37,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:37,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:37,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:37,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:37,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:32:37,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:32:37,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:37,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-12 20:32:37,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:37,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:32:37,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:32:37,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:32:37,921 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-12 20:32:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:38,054 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-12 20:32:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:32:38,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-12 20:32:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:38,057 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:32:38,057 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:32:38,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:32:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:32:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-12 20:32:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:32:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-12 20:32:38,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-12 20:32:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:38,065 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-12 20:32:38,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:32:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-12 20:32:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:32:38,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:38,066 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:38,066 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:38,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-12 20:32:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:38,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:38,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:38,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:38,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:38,314 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:38,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:38,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:38,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:38,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:38,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:38,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:32:38,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:32:38,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:38,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-12 20:32:38,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:32:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:32:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:32:38,625 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-11-12 20:32:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:38,795 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-12 20:32:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:32:38,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-12 20:32:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:38,798 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:32:38,798 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:32:38,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:32:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:32:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-12 20:32:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:32:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-12 20:32:38,805 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-11-12 20:32:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:38,805 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-12 20:32:38,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:32:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-12 20:32:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:32:38,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:38,807 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:38,807 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:38,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-12 20:32:38,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:38,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:38,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:39,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:39,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:39,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:39,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:39,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:39,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:39,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:39,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:39,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:32:39,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:39,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:32:39,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:32:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:39,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 17 [2018-11-12 20:32:39,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:39,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:32:39,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:32:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:32:39,402 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-11-12 20:32:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:41,834 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-12 20:32:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:32:41,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-12 20:32:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:41,838 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:32:41,838 INFO L226 Difference]: Without dead ends: 46 [2018-11-12 20:32:41,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:32:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-12 20:32:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-12 20:32:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:32:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-12 20:32:41,847 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2018-11-12 20:32:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-12 20:32:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:32:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-12 20:32:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:32:41,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:41,849 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:41,849 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:41,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-12 20:32:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:41,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:41,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:42,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:42,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:42,152 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:42,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:42,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:42,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:42,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:42,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:42,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:42,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:42,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-12 20:32:42,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:42,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:32:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:32:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:32:42,718 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2018-11-12 20:32:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:42,911 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-12 20:32:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:32:42,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-12 20:32:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:42,913 INFO L225 Difference]: With dead ends: 61 [2018-11-12 20:32:42,913 INFO L226 Difference]: Without dead ends: 45 [2018-11-12 20:32:42,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:32:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-12 20:32:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-12 20:32:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:32:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-12 20:32:42,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-12 20:32:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:42,921 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-12 20:32:42,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:32:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-12 20:32:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:32:42,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:42,922 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:42,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:42,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-12 20:32:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:42,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:42,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:43,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:43,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:43,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:43,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:43,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:43,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:43,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:43,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:43,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:32:43,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:32:43,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:43,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-12 20:32:43,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:43,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:32:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:32:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:32:43,738 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2018-11-12 20:32:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:43,978 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-12 20:32:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:32:43,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-12 20:32:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:43,980 INFO L225 Difference]: With dead ends: 64 [2018-11-12 20:32:43,980 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:32:43,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:32:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:32:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-12 20:32:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:32:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-12 20:32:43,987 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2018-11-12 20:32:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:43,987 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-12 20:32:43,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:32:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-12 20:32:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:32:43,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:43,989 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:43,989 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:43,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:43,989 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-12 20:32:43,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:43,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:43,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:43,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:43,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:44,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:44,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:44,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:44,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:44,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:44,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:44,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:44,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:44,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:32:44,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:44,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:32:44,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-12 20:32:44,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:44,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 23 [2018-11-12 20:32:44,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:44,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:32:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:32:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:32:44,725 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 19 states. [2018-11-12 20:32:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:51,096 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-12 20:32:51,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:32:51,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-12 20:32:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:51,098 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:32:51,098 INFO L226 Difference]: Without dead ends: 59 [2018-11-12 20:32:51,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=214, Invalid=487, Unknown=1, NotChecked=0, Total=702 [2018-11-12 20:32:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-12 20:32:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-12 20:32:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:32:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-12 20:32:51,106 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 47 [2018-11-12 20:32:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:51,107 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-12 20:32:51,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:32:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-12 20:32:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:32:51,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:51,108 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:51,108 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:51,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-12 20:32:51,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:51,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:51,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:51,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:51,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:51,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:51,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:51,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:51,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:51,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:51,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:51,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:51,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:32:51,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:32:52,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:52,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-12 20:32:52,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:52,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:32:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:32:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:32:52,510 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-12 20:32:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:52,910 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-12 20:32:52,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:32:52,911 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-12 20:32:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:52,912 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:32:52,912 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:32:52,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:32:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:32:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-12 20:32:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:32:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-12 20:32:52,920 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 53 [2018-11-12 20:32:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:52,920 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-12 20:32:52,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:32:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-12 20:32:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-12 20:32:52,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:52,922 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:52,922 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:52,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash 786973339, now seen corresponding path program 10 times [2018-11-12 20:32:52,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:52,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:52,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:53,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:53,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:53,363 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:53,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:53,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:53,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:53,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:53,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:32:53,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:32:54,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 31 [2018-11-12 20:32:54,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:54,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:32:54,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:32:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=662, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:32:54,096 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 18 states. [2018-11-12 20:32:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:54,623 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-12 20:32:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:32:54,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-11-12 20:32:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:54,624 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:32:54,624 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:32:54,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=662, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:32:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:32:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-12 20:32:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:32:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-12 20:32:54,631 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 56 [2018-11-12 20:32:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:54,632 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-12 20:32:54,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:32:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-12 20:32:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-12 20:32:54,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:54,633 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:54,633 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:54,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 11 times [2018-11-12 20:32:54,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:54,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:54,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:32:54,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:54,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:54,965 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:54,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:54,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:54,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:54,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:54,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:59,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-12 20:32:59,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:59,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 168 proven. 26 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-12 20:32:59,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 168 proven. 26 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-12 20:32:59,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 29 [2018-11-12 20:32:59,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:59,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:32:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:32:59,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:32:59,454 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 24 states. [2018-11-12 20:33:02,651 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:33:10,053 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:33:26,941 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:33:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:35,741 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2018-11-12 20:33:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:33:35,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-11-12 20:33:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:35,742 INFO L225 Difference]: With dead ends: 98 [2018-11-12 20:33:35,743 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:33:35,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=372, Invalid=884, Unknown=4, NotChecked=0, Total=1260 [2018-11-12 20:33:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:33:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2018-11-12 20:33:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-12 20:33:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-11-12 20:33:35,752 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 59 [2018-11-12 20:33:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:35,752 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-12 20:33:35,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:33:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-11-12 20:33:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-12 20:33:35,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:35,754 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:35,754 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:35,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1319222592, now seen corresponding path program 12 times [2018-11-12 20:33:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:35,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:35,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:35,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:36,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:36,234 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:36,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:36,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:36,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:36,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:36,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:36,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:33:36,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 273 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:33:37,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:37,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 36 [2018-11-12 20:33:37,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:37,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:33:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:33:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:33:37,489 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 21 states. [2018-11-12 20:33:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:37,922 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-12 20:33:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:33:37,923 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-12 20:33:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:37,924 INFO L225 Difference]: With dead ends: 91 [2018-11-12 20:33:37,924 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:33:37,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=355, Invalid=905, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:33:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:33:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-12 20:33:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:33:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-11-12 20:33:37,932 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 65 [2018-11-12 20:33:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:37,933 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-11-12 20:33:37,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:33:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-11-12 20:33:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-12 20:33:37,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:37,934 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:37,934 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:37,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1618626467, now seen corresponding path program 13 times [2018-11-12 20:33:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:37,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:37,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:38,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:38,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:38,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:38,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:38,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:38,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:38,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:38,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:38,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:33:38,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:33:39,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:39,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18] total 38 [2018-11-12 20:33:39,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:39,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:33:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:33:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1012, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:33:39,816 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 22 states. [2018-11-12 20:33:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:40,645 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-12 20:33:40,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:33:40,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-11-12 20:33:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:40,646 INFO L225 Difference]: With dead ends: 94 [2018-11-12 20:33:40,647 INFO L226 Difference]: Without dead ends: 72 [2018-11-12 20:33:40,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=394, Invalid=1012, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:33:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-12 20:33:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-12 20:33:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:33:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-11-12 20:33:40,655 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 68 [2018-11-12 20:33:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:40,655 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-12 20:33:40,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:33:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-12 20:33:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 20:33:40,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:40,657 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:40,657 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:40,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash -512392800, now seen corresponding path program 14 times [2018-11-12 20:33:40,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:40,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:41,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:41,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:41,634 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:41,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:41,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:41,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:41,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:41,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:46,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:33:46,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:46,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-12 20:33:47,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-12 20:33:47,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:47,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 35 [2018-11-12 20:33:47,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:47,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:33:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:33:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:33:47,236 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 29 states. [2018-11-12 20:33:50,561 WARN L179 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:33:54,504 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:33:58,009 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-12 20:34:25,409 WARN L179 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:34:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:45,492 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2018-11-12 20:34:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:34:45,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 71 [2018-11-12 20:34:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:45,493 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:34:45,493 INFO L226 Difference]: Without dead ends: 89 [2018-11-12 20:34:45,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=517, Invalid=1285, Unknown=4, NotChecked=0, Total=1806 [2018-11-12 20:34:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-12 20:34:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-12 20:34:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:34:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-11-12 20:34:45,503 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 71 [2018-11-12 20:34:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:45,503 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-11-12 20:34:45,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:34:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-11-12 20:34:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-12 20:34:45,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:45,510 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:45,510 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:45,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2099613118, now seen corresponding path program 15 times [2018-11-12 20:34:45,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:45,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:45,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:45,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:45,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 44 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:46,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:46,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:46,548 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:46,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:46,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:46,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:46,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:46,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:46,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:46,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 160 proven. 570 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:34:46,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 160 proven. 570 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:34:48,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:48,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 46 [2018-11-12 20:34:48,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:48,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:34:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:34:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:34:48,866 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 25 states. [2018-11-12 20:34:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:49,415 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-12 20:34:49,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:34:49,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-12 20:34:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:49,422 INFO L225 Difference]: With dead ends: 109 [2018-11-12 20:34:49,423 INFO L226 Difference]: Without dead ends: 84 [2018-11-12 20:34:49,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:34:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-12 20:34:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-12 20:34:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-12 20:34:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-11-12 20:34:49,430 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 77 [2018-11-12 20:34:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:49,430 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-11-12 20:34:49,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:34:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-11-12 20:34:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:34:49,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:49,431 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:49,431 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:49,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1326089058, now seen corresponding path program 16 times [2018-11-12 20:34:49,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:49,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:49,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 48 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:50,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:50,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:50,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:50,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:50,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:50,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:50,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:50,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:50,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:34:50,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:34:52,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:52,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 22] total 47 [2018-11-12 20:34:52,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:52,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:34:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:34:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=1546, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:34:52,895 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 27 states. [2018-11-12 20:34:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:53,555 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-11-12 20:34:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:34:53,555 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-12 20:34:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:53,557 INFO L225 Difference]: With dead ends: 115 [2018-11-12 20:34:53,557 INFO L226 Difference]: Without dead ends: 90 [2018-11-12 20:34:53,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=616, Invalid=1546, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:34:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-12 20:34:53,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-12 20:34:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-12 20:34:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-11-12 20:34:53,567 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 83 [2018-11-12 20:34:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:53,567 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-11-12 20:34:53,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:34:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-12 20:34:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:34:53,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:53,569 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 20, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:53,569 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:53,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash -502348930, now seen corresponding path program 17 times [2018-11-12 20:34:53,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:53,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:53,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 52 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:54,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:54,850 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:54,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:54,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:54,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:55,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-12 20:34:55,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:55,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 57 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-12 20:34:55,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 400 proven. 57 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-12 20:34:55,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:55,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9] total 43 [2018-11-12 20:34:55,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:55,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:34:55,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:34:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1326, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:34:55,903 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 36 states. [2018-11-12 20:34:59,583 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:35:05,706 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:35:10,308 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:35:15,952 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:35:28,250 WARN L179 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:35:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:39,241 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-12 20:35:39,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:35:39,241 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-11-12 20:35:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:39,242 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:35:39,242 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 20:35:39,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=758, Invalid=1891, Unknown=3, NotChecked=0, Total=2652 [2018-11-12 20:35:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 20:35:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2018-11-12 20:35:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:35:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-11-12 20:35:39,250 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 89 [2018-11-12 20:35:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-11-12 20:35:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:35:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-11-12 20:35:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-12 20:35:39,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:39,251 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 22, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:39,252 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:39,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2002812611, now seen corresponding path program 18 times [2018-11-12 20:35:39,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:39,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:39,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 140 proven. 1134 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:35:40,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:40,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:40,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:40,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:40,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:40,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:40,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:40,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:40,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:40,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:40,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 759 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:35:40,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 756 refuted. 3 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:35:46,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 26] total 55 [2018-11-12 20:35:46,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:46,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:35:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:35:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=2137, Unknown=1, NotChecked=0, Total=2970 [2018-11-12 20:35:46,474 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 31 states. [2018-11-12 20:35:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:47,513 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2018-11-12 20:35:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:35:47,515 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 98 [2018-11-12 20:35:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:47,517 INFO L225 Difference]: With dead ends: 133 [2018-11-12 20:35:47,517 INFO L226 Difference]: Without dead ends: 105 [2018-11-12 20:35:47,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=832, Invalid=2137, Unknown=1, NotChecked=0, Total=2970 [2018-11-12 20:35:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-12 20:35:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-12 20:35:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-12 20:35:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-11-12 20:35:47,529 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 98 [2018-11-12 20:35:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:47,529 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-11-12 20:35:47,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:35:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-11-12 20:35:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 20:35:47,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:47,530 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 24, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:47,531 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:47,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash 615751261, now seen corresponding path program 19 times [2018-11-12 20:35:47,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:47,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:47,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:47,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:47,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 150 proven. 1305 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:35:48,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:48,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:48,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:48,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:48,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:48,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:48,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:48,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 500 proven. 900 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:35:48,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 500 proven. 900 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:35:51,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 28] total 59 [2018-11-12 20:35:51,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:35:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:35:51,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=952, Invalid=2470, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:35:51,635 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 33 states. [2018-11-12 20:35:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:52,672 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2018-11-12 20:35:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:35:52,673 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-11-12 20:35:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:52,674 INFO L225 Difference]: With dead ends: 139 [2018-11-12 20:35:52,674 INFO L226 Difference]: Without dead ends: 111 [2018-11-12 20:35:52,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=952, Invalid=2470, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:35:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-12 20:35:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-12 20:35:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-12 20:35:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-11-12 20:35:52,684 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 104 [2018-11-12 20:35:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:52,684 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-11-12 20:35:52,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:35:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-11-12 20:35:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-12 20:35:52,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:52,685 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 26, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:52,686 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:52,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 323314557, now seen corresponding path program 20 times [2018-11-12 20:35:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:52,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 160 proven. 1488 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:35:53,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:53,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:53,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:53,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:53,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:53,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:53,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:53,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:35:53,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:53,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 598 proven. 77 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-12 20:35:54,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 598 proven. 77 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2018-11-12 20:35:55,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:55,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 10, 10] total 51 [2018-11-12 20:35:55,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:55,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:35:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:35:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:35:55,106 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 43 states. [2018-11-12 20:36:00,373 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2018-11-12 20:36:13,322 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-12 20:36:24,379 WARN L179 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-12 20:36:45,790 WARN L179 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-12 20:36:54,900 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 Received shutdown request... [2018-11-12 20:37:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:37:08,655 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:37:08,659 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:37:08,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:37:08 BoogieIcfgContainer [2018-11-12 20:37:08,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:37:08,660 INFO L168 Benchmark]: Toolchain (without parser) took 276552.04 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 924.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -959.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:37:08,661 INFO L168 Benchmark]: CDTParser took 0.19 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-12 20:37:08,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.41 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-12 20:37:08,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.60 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-12 20:37:08,663 INFO L168 Benchmark]: Boogie Preprocessor took 25.45 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-12 20:37:08,663 INFO L168 Benchmark]: RCFGBuilder took 353.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:37:08,664 INFO L168 Benchmark]: TraceAbstraction took 275891.34 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -157.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:37:08,668 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.41 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 22.60 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 25.45 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 353.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275891.34 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -157.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and FLOYD_HOARE automaton (currently 39 states, 43 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 275.8s OverallTime, 24 OverallIterations, 34 TraceHistogramMax, 227.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 532 SDtfs, 355 SDslu, 7177 SDs, 0 SdLazy, 11305 SolverSat, 666 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 81.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2937 GetRequests, 2234 SyntacticMatches, 51 SemanticMatches, 651 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 176.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 46 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 10.3s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 2491 NumberOfCodeBlocks, 2272 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 3658 ConstructedInterpolants, 0 QuantifiedInterpolants, 1494854 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1796 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 13244/31695 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown