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-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:41:50,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:41:50,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:41:50,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:41:50,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:41:50,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:41:50,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:41:50,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:41:50,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:41:50,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:41:50,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:41:50,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:41:50,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:41:50,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:41:50,429 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:41:50,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:41:50,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:41:50,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:41:50,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:41:50,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:41:50,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:41:50,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:41:50,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:41:50,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:41:50,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:41:50,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:41:50,444 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:41:50,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:41:50,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:41:50,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:41:50,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:41:50,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:41:50,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:41:50,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:41:50,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:41:50,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:41:50,450 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:41:50,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:41:50,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:41:50,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:41:50,483 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:41:50,483 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:41:50,483 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:41:50,484 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:41:50,485 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:41:50,485 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:41:50,485 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:41:50,485 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:41:50,485 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:41:50,486 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:41:50,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:41:50,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:41:50,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:41:50,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:41:50,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:41:50,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:41:50,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:41:50,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:41:50,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:41:50,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:41:50,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:41:50,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:41:50,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:41:50,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:41:50,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:41:50,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:41:50,492 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:41:50,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:41:50,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:41:50,493 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:41:50,493 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:41:50,493 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:41:50,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:41:50,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:41:50,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:41:50,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:41:50,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:41:50,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-11-12 20:41:50,616 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf5c28d6/41482173fb28448f8a882af5c24481d5/FLAGfafb34384 [2018-11-12 20:41:51,076 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:41:51,077 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-11-12 20:41:51,090 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf5c28d6/41482173fb28448f8a882af5c24481d5/FLAGfafb34384 [2018-11-12 20:41:51,118 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf5c28d6/41482173fb28448f8a882af5c24481d5 [2018-11-12 20:41:51,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:41:51,130 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:41:51,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:41:51,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:41:51,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:41:51,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4990244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51, skipping insertion in model container [2018-11-12 20:41:51,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:41:51,215 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:41:51,597 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:41:51,603 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:41:51,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:41:51,696 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:41:51,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51 WrapperNode [2018-11-12 20:41:51,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:41:51,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:41:51,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:41:51,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:41:51,705 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:41:51" (1/1) ... [2018-11-12 20:41:51,717 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:41:51" (1/1) ... [2018-11-12 20:41:51,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:41:51,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:41:51,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:41:51,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:41:51,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (1/1) ... [2018-11-12 20:41:51,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:41:51,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:41:51,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:41:51,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:41:51,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (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:41:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:41:51,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:41:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:41:51,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:41:51,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:41:51,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:41:53,369 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:41:53,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:41:53 BoogieIcfgContainer [2018-11-12 20:41:53,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:41:53,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:41:53,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:41:53,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:41:53,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:41:51" (1/3) ... [2018-11-12 20:41:53,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a5b18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:41:53, skipping insertion in model container [2018-11-12 20:41:53,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:41:51" (2/3) ... [2018-11-12 20:41:53,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a5b18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:41:53, skipping insertion in model container [2018-11-12 20:41:53,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:41:53" (3/3) ... [2018-11-12 20:41:53,379 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-11-12 20:41:53,389 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:41:53,398 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:41:53,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:41:53,454 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:41:53,455 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:41:53,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:41:53,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:41:53,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:41:53,456 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:41:53,456 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:41:53,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:41:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-12 20:41:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:41:53,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:53,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:53,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2018-11-12 20:41:53,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:53,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:53,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:53,747 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:41:53,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:53,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:41:53,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:53,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:41:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:41:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:53,777 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-11-12 20:41:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:55,063 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2018-11-12 20:41:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:41:55,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-12 20:41:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:55,081 INFO L225 Difference]: With dead ends: 290 [2018-11-12 20:41:55,081 INFO L226 Difference]: Without dead ends: 145 [2018-11-12 20:41:55,086 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-12 20:41:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-11-12 20:41:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-12 20:41:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2018-11-12 20:41:55,152 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2018-11-12 20:41:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:55,153 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2018-11-12 20:41:55,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:41:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2018-11-12 20:41:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:41:55,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:55,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:55,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:55,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:55,161 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2018-11-12 20:41:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:55,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:55,345 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:41:55,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:55,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:41:55,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:55,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:41:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:41:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:55,349 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2018-11-12 20:41:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:56,424 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2018-11-12 20:41:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:41:56,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-12 20:41:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:56,428 INFO L225 Difference]: With dead ends: 410 [2018-11-12 20:41:56,428 INFO L226 Difference]: Without dead ends: 277 [2018-11-12 20:41:56,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:41:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-12 20:41:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-11-12 20:41:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-12 20:41:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2018-11-12 20:41:56,460 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2018-11-12 20:41:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:56,461 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2018-11-12 20:41:56,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:41:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2018-11-12 20:41:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:41:56,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:56,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:56,466 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:56,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2018-11-12 20:41:56,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:56,769 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:41:56,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:56,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:41:56,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:41:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:41:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:56,772 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2018-11-12 20:41:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:57,958 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2018-11-12 20:41:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:41:57,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2018-11-12 20:41:57,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:57,961 INFO L225 Difference]: With dead ends: 404 [2018-11-12 20:41:57,961 INFO L226 Difference]: Without dead ends: 269 [2018-11-12 20:41:57,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:41:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-12 20:41:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-12 20:41:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-12 20:41:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2018-11-12 20:41:57,984 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2018-11-12 20:41:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:57,984 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2018-11-12 20:41:57,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:41:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2018-11-12 20:41:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:41:57,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:57,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:57,989 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:57,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2018-11-12 20:41:57,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:57,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:57,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:58,181 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:41:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:41:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-12 20:41:58,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:41:58,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:41:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:41:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:41:58,183 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2018-11-12 20:41:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:59,919 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2018-11-12 20:41:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:41:59,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2018-11-12 20:41:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:59,922 INFO L225 Difference]: With dead ends: 394 [2018-11-12 20:41:59,922 INFO L226 Difference]: Without dead ends: 267 [2018-11-12 20:41:59,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:41:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-12 20:41:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-12 20:41:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-12 20:41:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2018-11-12 20:41:59,943 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2018-11-12 20:41:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:59,943 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2018-11-12 20:41:59,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:41:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2018-11-12 20:41:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:41:59,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:59,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:59,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:59,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2018-11-12 20:41:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:59,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:00,118 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:42:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-12 20:42:00,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:00,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:42:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:42:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:42:00,120 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2018-11-12 20:42:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:01,280 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2018-11-12 20:42:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:42:01,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-11-12 20:42:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:01,283 INFO L225 Difference]: With dead ends: 390 [2018-11-12 20:42:01,284 INFO L226 Difference]: Without dead ends: 265 [2018-11-12 20:42:01,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:42:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-12 20:42:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-11-12 20:42:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-12 20:42:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2018-11-12 20:42:01,304 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2018-11-12 20:42:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:01,305 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2018-11-12 20:42:01,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:42:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2018-11-12 20:42:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:01,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:01,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:01,308 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:01,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2018-11-12 20:42:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:01,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:01,697 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:42:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:01,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-12 20:42:01,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:01,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:42:01,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:42:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:42:01,699 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2018-11-12 20:42:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:02,451 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2018-11-12 20:42:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:42:02,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2018-11-12 20:42:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:02,453 INFO L225 Difference]: With dead ends: 382 [2018-11-12 20:42:02,453 INFO L226 Difference]: Without dead ends: 259 [2018-11-12 20:42:02,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:42:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-12 20:42:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-11-12 20:42:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-12 20:42:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2018-11-12 20:42:02,464 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2018-11-12 20:42:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:02,465 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2018-11-12 20:42:02,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:42:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2018-11-12 20:42:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:02,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:02,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:02,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:02,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:02,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2018-11-12 20:42:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:02,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:02,694 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:42:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-12 20:42:02,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:42:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:42:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:42:02,697 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2018-11-12 20:42:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:04,232 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2018-11-12 20:42:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:42:04,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2018-11-12 20:42:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:04,235 INFO L225 Difference]: With dead ends: 372 [2018-11-12 20:42:04,235 INFO L226 Difference]: Without dead ends: 255 [2018-11-12 20:42:04,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:42:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-12 20:42:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-11-12 20:42:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-12 20:42:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-11-12 20:42:04,246 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2018-11-12 20:42:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:04,247 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-11-12 20:42:04,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:42:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-11-12 20:42:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:04,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:04,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:04,251 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:04,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:04,251 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2018-11-12 20:42:04,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:04,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:04,474 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:42:04,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:04,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-12 20:42:04,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:04,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:42:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:42:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:42:04,476 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2018-11-12 20:42:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:05,059 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2018-11-12 20:42:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:42:05,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2018-11-12 20:42:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:05,063 INFO L225 Difference]: With dead ends: 366 [2018-11-12 20:42:05,063 INFO L226 Difference]: Without dead ends: 253 [2018-11-12 20:42:05,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:42:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-12 20:42:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-11-12 20:42:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-12 20:42:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2018-11-12 20:42:05,073 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2018-11-12 20:42:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:05,074 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2018-11-12 20:42:05,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:42:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2018-11-12 20:42:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:05,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:05,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:05,076 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2018-11-12 20:42:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:05,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:05,387 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:42:05,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:05,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-12 20:42:05,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:05,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:42:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:42:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:42:05,389 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2018-11-12 20:42:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:07,177 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2018-11-12 20:42:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:42:07,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-11-12 20:42:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:07,180 INFO L225 Difference]: With dead ends: 360 [2018-11-12 20:42:07,181 INFO L226 Difference]: Without dead ends: 249 [2018-11-12 20:42:07,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:42:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-12 20:42:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-12 20:42:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-12 20:42:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2018-11-12 20:42:07,192 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2018-11-12 20:42:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:07,192 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2018-11-12 20:42:07,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:42:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2018-11-12 20:42:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:07,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:07,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:07,195 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:07,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2018-11-12 20:42:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:07,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:07,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:07,773 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:42:07,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:07,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-12 20:42:07,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:07,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:07,775 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2018-11-12 20:42:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:10,254 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2018-11-12 20:42:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:42:10,255 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2018-11-12 20:42:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:10,258 INFO L225 Difference]: With dead ends: 352 [2018-11-12 20:42:10,258 INFO L226 Difference]: Without dead ends: 245 [2018-11-12 20:42:10,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-12 20:42:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-11-12 20:42:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-12 20:42:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2018-11-12 20:42:10,268 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2018-11-12 20:42:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:10,269 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2018-11-12 20:42:10,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2018-11-12 20:42:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:10,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:10,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:10,271 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:10,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2018-11-12 20:42:10,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:10,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:10,611 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:42:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:10,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-11-12 20:42:10,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:10,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:42:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:42:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:10,613 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2018-11-12 20:42:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:11,487 INFO L93 Difference]: Finished difference Result 340 states and 392 transitions. [2018-11-12 20:42:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:42:11,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2018-11-12 20:42:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:11,490 INFO L225 Difference]: With dead ends: 340 [2018-11-12 20:42:11,491 INFO L226 Difference]: Without dead ends: 237 [2018-11-12 20:42:11,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-12 20:42:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-11-12 20:42:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-12 20:42:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2018-11-12 20:42:11,501 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2018-11-12 20:42:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:11,502 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2018-11-12 20:42:11,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:42:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2018-11-12 20:42:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:11,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:11,503 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:11,504 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:11,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2018-11-12 20:42:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:11,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:11,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:12,009 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:42:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:12,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-11-12 20:42:12,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:12,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:42:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:42:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:12,011 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2018-11-12 20:42:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:14,215 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2018-11-12 20:42:14,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:42:14,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2018-11-12 20:42:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:14,218 INFO L225 Difference]: With dead ends: 330 [2018-11-12 20:42:14,218 INFO L226 Difference]: Without dead ends: 235 [2018-11-12 20:42:14,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-12 20:42:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-11-12 20:42:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-12 20:42:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2018-11-12 20:42:14,226 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2018-11-12 20:42:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:14,227 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2018-11-12 20:42:14,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:42:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2018-11-12 20:42:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:14,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:14,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:14,229 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:14,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2018-11-12 20:42:14,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:14,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:14,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:14,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:15,049 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:42:15,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:15,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-11-12 20:42:15,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:15,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:42:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:42:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:42:15,051 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2018-11-12 20:42:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:17,207 INFO L93 Difference]: Finished difference Result 326 states and 373 transitions. [2018-11-12 20:42:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:42:17,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2018-11-12 20:42:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:17,210 INFO L225 Difference]: With dead ends: 326 [2018-11-12 20:42:17,210 INFO L226 Difference]: Without dead ends: 233 [2018-11-12 20:42:17,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:42:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-12 20:42:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-11-12 20:42:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-12 20:42:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-11-12 20:42:17,220 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2018-11-12 20:42:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:17,220 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-11-12 20:42:17,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:42:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-11-12 20:42:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:17,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:17,222 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:17,222 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:17,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2018-11-12 20:42:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:17,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:18,210 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:42:18,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:18,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-11-12 20:42:18,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:18,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:42:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:42:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:42:18,212 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2018-11-12 20:42:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:20,595 INFO L93 Difference]: Finished difference Result 318 states and 364 transitions. [2018-11-12 20:42:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:42:20,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2018-11-12 20:42:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:20,597 INFO L225 Difference]: With dead ends: 318 [2018-11-12 20:42:20,598 INFO L226 Difference]: Without dead ends: 227 [2018-11-12 20:42:20,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:42:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-12 20:42:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-12 20:42:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-12 20:42:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2018-11-12 20:42:20,607 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2018-11-12 20:42:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:20,607 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2018-11-12 20:42:20,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:42:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-12 20:42:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:20,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,609 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,609 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2018-11-12 20:42:20,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,478 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:42:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-11-12 20:42:21,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:42:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:42:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:42:21,479 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2018-11-12 20:42:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:22,277 INFO L93 Difference]: Finished difference Result 308 states and 351 transitions. [2018-11-12 20:42:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:42:22,278 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2018-11-12 20:42:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:22,280 INFO L225 Difference]: With dead ends: 308 [2018-11-12 20:42:22,280 INFO L226 Difference]: Without dead ends: 223 [2018-11-12 20:42:22,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:42:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-12 20:42:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-12 20:42:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-12 20:42:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2018-11-12 20:42:22,290 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2018-11-12 20:42:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:22,290 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2018-11-12 20:42:22,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:42:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2018-11-12 20:42:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:22,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:22,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:22,292 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:22,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2018-11-12 20:42:22,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:22,975 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:42:22,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:22,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-11-12 20:42:22,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:22,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:42:22,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:42:22,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:42:22,978 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2018-11-12 20:42:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:25,433 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2018-11-12 20:42:25,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:42:25,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-11-12 20:42:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:25,435 INFO L225 Difference]: With dead ends: 302 [2018-11-12 20:42:25,435 INFO L226 Difference]: Without dead ends: 221 [2018-11-12 20:42:25,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:42:25,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-12 20:42:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-11-12 20:42:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-12 20:42:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2018-11-12 20:42:25,444 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2018-11-12 20:42:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:25,444 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2018-11-12 20:42:25,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:42:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2018-11-12 20:42:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:25,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:25,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:25,446 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:25,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2018-11-12 20:42:25,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:25,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:26,984 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:42:26,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:26,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2018-11-12 20:42:26,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:42:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:42:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:42:26,986 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2018-11-12 20:42:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:29,735 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2018-11-12 20:42:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:42:29,736 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2018-11-12 20:42:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:29,737 INFO L225 Difference]: With dead ends: 296 [2018-11-12 20:42:29,738 INFO L226 Difference]: Without dead ends: 217 [2018-11-12 20:42:29,739 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:42:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-12 20:42:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-12 20:42:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-12 20:42:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2018-11-12 20:42:29,745 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2018-11-12 20:42:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:29,745 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2018-11-12 20:42:29,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:42:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2018-11-12 20:42:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:29,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:29,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:29,747 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:29,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2018-11-12 20:42:29,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:29,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:29,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:29,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:30,354 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:42:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2018-11-12 20:42:30,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:30,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:42:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:42:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:42:30,356 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2018-11-12 20:42:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:31,485 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2018-11-12 20:42:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:42:31,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2018-11-12 20:42:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:31,488 INFO L225 Difference]: With dead ends: 288 [2018-11-12 20:42:31,488 INFO L226 Difference]: Without dead ends: 213 [2018-11-12 20:42:31,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:42:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-12 20:42:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-11-12 20:42:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-12 20:42:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2018-11-12 20:42:31,495 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2018-11-12 20:42:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:31,495 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2018-11-12 20:42:31,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:42:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2018-11-12 20:42:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:31,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:31,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:31,496 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:31,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2018-11-12 20:42:31,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:31,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:33,384 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:42:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2018-11-12 20:42:33,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:33,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:42:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:42:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:42:33,387 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2018-11-12 20:42:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:35,399 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2018-11-12 20:42:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:42:35,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2018-11-12 20:42:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:35,401 INFO L225 Difference]: With dead ends: 276 [2018-11-12 20:42:35,401 INFO L226 Difference]: Without dead ends: 205 [2018-11-12 20:42:35,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:42:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-12 20:42:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-11-12 20:42:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-12 20:42:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2018-11-12 20:42:35,407 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2018-11-12 20:42:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2018-11-12 20:42:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:42:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2018-11-12 20:42:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:35,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:35,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:35,409 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2018-11-12 20:42:35,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:35,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,320 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:42:37,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:37,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2018-11-12 20:42:37,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:37,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:42:37,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:42:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:37,322 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2018-11-12 20:42:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:38,873 INFO L93 Difference]: Finished difference Result 266 states and 298 transitions. [2018-11-12 20:42:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:42:38,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2018-11-12 20:42:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:38,876 INFO L225 Difference]: With dead ends: 266 [2018-11-12 20:42:38,876 INFO L226 Difference]: Without dead ends: 203 [2018-11-12 20:42:38,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-12 20:42:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-11-12 20:42:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-12 20:42:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2018-11-12 20:42:38,883 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2018-11-12 20:42:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:38,883 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2018-11-12 20:42:38,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:42:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2018-11-12 20:42:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:38,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:38,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:38,885 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:38,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2018-11-12 20:42:38,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:40,495 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:42:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2018-11-12 20:42:40,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:40,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:42:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:42:40,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:40,497 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2018-11-12 20:42:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:43,363 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2018-11-12 20:42:43,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:42:43,366 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2018-11-12 20:42:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:43,367 INFO L225 Difference]: With dead ends: 262 [2018-11-12 20:42:43,367 INFO L226 Difference]: Without dead ends: 201 [2018-11-12 20:42:43,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-12 20:42:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-12 20:42:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-12 20:42:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-11-12 20:42:43,374 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2018-11-12 20:42:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:43,374 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-11-12 20:42:43,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:42:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-11-12 20:42:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:43,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:43,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:43,376 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2018-11-12 20:42:43,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:43,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:43,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:44,441 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:42:44,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:44,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2018-11-12 20:42:44,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:42:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:42:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:44,443 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2018-11-12 20:42:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:45,887 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2018-11-12 20:42:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:42:45,891 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2018-11-12 20:42:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:45,895 INFO L225 Difference]: With dead ends: 254 [2018-11-12 20:42:45,895 INFO L226 Difference]: Without dead ends: 195 [2018-11-12 20:42:45,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:42:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-12 20:42:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-11-12 20:42:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-12 20:42:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-11-12 20:42:45,902 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2018-11-12 20:42:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:45,902 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-11-12 20:42:45,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:42:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-11-12 20:42:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:45,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:45,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:45,904 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:45,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2018-11-12 20:42:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:45,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:46,943 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:42:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:46,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2018-11-12 20:42:46,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:46,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:42:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:42:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:46,946 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2018-11-12 20:42:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:49,111 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-11-12 20:42:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:42:49,112 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2018-11-12 20:42:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:49,113 INFO L225 Difference]: With dead ends: 244 [2018-11-12 20:42:49,113 INFO L226 Difference]: Without dead ends: 191 [2018-11-12 20:42:49,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:42:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-12 20:42:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-11-12 20:42:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-12 20:42:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2018-11-12 20:42:49,120 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2018-11-12 20:42:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:49,121 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2018-11-12 20:42:49,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:42:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-11-12 20:42:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:49,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:49,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:49,122 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:49,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2018-11-12 20:42:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:49,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:50,154 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:42:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:50,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-11-12 20:42:50,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:50,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:42:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:42:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:42:50,157 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2018-11-12 20:42:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:51,622 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-11-12 20:42:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:42:51,623 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-11-12 20:42:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:51,625 INFO L225 Difference]: With dead ends: 238 [2018-11-12 20:42:51,625 INFO L226 Difference]: Without dead ends: 189 [2018-11-12 20:42:51,627 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:42:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-12 20:42:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-12 20:42:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-12 20:42:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-11-12 20:42:51,632 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2018-11-12 20:42:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:51,632 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-11-12 20:42:51,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:42:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-11-12 20:42:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:51,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:51,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:51,634 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:51,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:51,634 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2018-11-12 20:42:51,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:51,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:51,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:53,090 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:42:53,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:53,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2018-11-12 20:42:53,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:53,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-12 20:42:53,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-12 20:42:53,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:42:53,092 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2018-11-12 20:42:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:54,651 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2018-11-12 20:42:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:42:54,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2018-11-12 20:42:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:54,653 INFO L225 Difference]: With dead ends: 232 [2018-11-12 20:42:54,654 INFO L226 Difference]: Without dead ends: 185 [2018-11-12 20:42:54,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:42:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-12 20:42:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-11-12 20:42:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-12 20:42:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-11-12 20:42:54,660 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2018-11-12 20:42:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:54,661 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-11-12 20:42:54,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-12 20:42:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-11-12 20:42:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:54,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:54,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:54,662 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:54,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2018-11-12 20:42:54,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:54,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:54,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:54,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:55,771 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:42:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-11-12 20:42:55,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:55,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:42:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:42:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:42:55,773 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2018-11-12 20:42:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:58,887 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2018-11-12 20:42:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:42:58,888 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2018-11-12 20:42:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:58,889 INFO L225 Difference]: With dead ends: 224 [2018-11-12 20:42:58,889 INFO L226 Difference]: Without dead ends: 181 [2018-11-12 20:42:58,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:42:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-12 20:42:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-11-12 20:42:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-12 20:42:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2018-11-12 20:42:58,895 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2018-11-12 20:42:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:58,895 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2018-11-12 20:42:58,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:42:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2018-11-12 20:42:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:42:58,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:58,896 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:58,897 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:58,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2018-11-12 20:42:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:58,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:00,463 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:43:00,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:43:00,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2018-11-12 20:43:00,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:43:00,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-12 20:43:00,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-12 20:43:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:43:00,465 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2018-11-12 20:43:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:01,717 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-11-12 20:43:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:43:01,718 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2018-11-12 20:43:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:01,719 INFO L225 Difference]: With dead ends: 216 [2018-11-12 20:43:01,719 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:43:01,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:43:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:43:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-12 20:43:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-12 20:43:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-11-12 20:43:01,727 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-11-12 20:43:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:01,728 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-11-12 20:43:01,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-12 20:43:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-11-12 20:43:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:43:01,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:01,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:01,729 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2018-11-12 20:43:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:02,042 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:43:02,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:43:02,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-11-12 20:43:02,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:43:02,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:43:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:43:02,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:43:02,044 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 22 states. [2018-11-12 20:43:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:02,718 INFO L93 Difference]: Finished difference Result 188 states and 191 transitions. [2018-11-12 20:43:02,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:43:02,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2018-11-12 20:43:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:02,721 INFO L225 Difference]: With dead ends: 188 [2018-11-12 20:43:02,721 INFO L226 Difference]: Without dead ends: 185 [2018-11-12 20:43:02,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:43:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-12 20:43:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-11-12 20:43:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-12 20:43:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-11-12 20:43:02,729 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 143 [2018-11-12 20:43:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:02,729 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-11-12 20:43:02,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:43:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-11-12 20:43:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 20:43:02,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:02,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:02,731 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:02,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -861732141, now seen corresponding path program 1 times [2018-11-12 20:43:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:02,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:43:04,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:43:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-12 20:43:04,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:43:04,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:43:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:43:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:04,806 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 52 states. [2018-11-12 20:43:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:07,307 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-11-12 20:43:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:43:07,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2018-11-12 20:43:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:07,309 INFO L225 Difference]: With dead ends: 192 [2018-11-12 20:43:07,309 INFO L226 Difference]: Without dead ends: 150 [2018-11-12 20:43:07,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:43:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-12 20:43:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-12 20:43:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-12 20:43:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-11-12 20:43:07,317 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-11-12 20:43:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:07,317 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-11-12 20:43:07,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:43:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-11-12 20:43:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 20:43:07,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:07,318 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:07,318 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:07,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 1 times [2018-11-12 20:43:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:07,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:07,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:07,807 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-11-12 20:43:07,809 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [78], [81], [85], [88], [92], [95], [99], [102], [106], [109], [113], [116], [120], [123], [127], [130], [134], [137], [141], [144], [148], [151], [155], [158], [162], [165], [169], [172], [176], [179], [183], [186], [190], [193], [197], [200], [204], [207], [211], [214], [218], [221], [225], [228], [232], [235], [239], [242], [246], [249], [253], [256], [260], [263], [267], [270], [274], [277], [281], [284], [288], [291], [295], [298], [302], [305], [309], [312], [316], [319], [323], [326], [330], [333], [337], [340], [344], [347], [351], [354], [358], [365], [372], [379], [386], [393], [400], [407], [414], [421], [428], [435], [442], [449], [456], [463], [470], [477], [483], [485], [488], [489], [492], [495], [498], [501], [504], [507], [510], [513], [516], [519], [522], [525], [528], [531], [534], [537], [540], [694], [695], [696] [2018-11-12 20:43:07,857 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:43:07,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:43:08,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:43:08,435 INFO L272 AbstractInterpreter]: Visited 145 different actions 165 times. Merged at 5 different actions 15 times. Widened at 1 different actions 2 times. Performed 584 root evaluator evaluations with a maximum evaluation depth of 5. Performed 584 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-12 20:43:08,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:08,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:43:08,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:08,457 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:43:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:08,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:08,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:11,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:15,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 73, 73] total 102 [2018-11-12 20:43:15,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-12 20:43:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-12 20:43:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:15,168 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 75 states. [2018-11-12 20:43:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:17,416 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2018-11-12 20:43:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-12 20:43:17,416 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2018-11-12 20:43:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:17,418 INFO L225 Difference]: With dead ends: 160 [2018-11-12 20:43:17,418 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:43:17,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 178 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10292 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:43:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-11-12 20:43:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-12 20:43:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-11-12 20:43:17,434 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 149 [2018-11-12 20:43:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:17,435 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-11-12 20:43:17,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-12 20:43:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-11-12 20:43:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 20:43:17,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:17,436 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:17,436 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1326208088, now seen corresponding path program 2 times [2018-11-12 20:43:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:17,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:19,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:19,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:19,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:19,161 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:43:19,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:19,161 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:43:19,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:19,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:19,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:43:19,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:19,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:20,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:22,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 76, 76] total 102 [2018-11-12 20:43:22,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:22,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-12 20:43:22,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-12 20:43:22,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:22,320 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 78 states. [2018-11-12 20:43:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:23,486 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-11-12 20:43:23,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-11-12 20:43:23,487 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2018-11-12 20:43:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:23,488 INFO L225 Difference]: With dead ends: 166 [2018-11-12 20:43:23,489 INFO L226 Difference]: Without dead ends: 163 [2018-11-12 20:43:23,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 187 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11027 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-12 20:43:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-11-12 20:43:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-12 20:43:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-11-12 20:43:23,498 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 155 [2018-11-12 20:43:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-11-12 20:43:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-12 20:43:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-11-12 20:43:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-12 20:43:23,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:23,500 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:23,500 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:23,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1079575770, now seen corresponding path program 3 times [2018-11-12 20:43:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:23,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:23,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:24,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:24,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:24,909 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:24,909 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:43:24,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:24,909 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:43:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:24,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:24,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:24,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:25,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:26,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:27,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 79, 79] total 102 [2018-11-12 20:43:27,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:27,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-12 20:43:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-12 20:43:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:27,822 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 81 states. [2018-11-12 20:43:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:28,886 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-11-12 20:43:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-12 20:43:28,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2018-11-12 20:43:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:28,888 INFO L225 Difference]: With dead ends: 172 [2018-11-12 20:43:28,888 INFO L226 Difference]: Without dead ends: 169 [2018-11-12 20:43:28,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 196 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11762 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-12 20:43:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-11-12 20:43:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-12 20:43:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-11-12 20:43:28,901 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 161 [2018-11-12 20:43:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:28,901 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-11-12 20:43:28,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-12 20:43:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-11-12 20:43:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-12 20:43:28,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:28,902 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:28,903 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:28,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1334784140, now seen corresponding path program 4 times [2018-11-12 20:43:28,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:28,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:28,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:29,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:29,791 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:43:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:29,791 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:43:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:29,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:29,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:31,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:32,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 82, 82] total 102 [2018-11-12 20:43:32,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:32,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-12 20:43:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-12 20:43:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:32,827 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 84 states. [2018-11-12 20:43:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:33,986 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2018-11-12 20:43:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-12 20:43:33,986 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 167 [2018-11-12 20:43:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:33,988 INFO L225 Difference]: With dead ends: 178 [2018-11-12 20:43:33,988 INFO L226 Difference]: Without dead ends: 175 [2018-11-12 20:43:33,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 205 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12497 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-12 20:43:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-11-12 20:43:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-12 20:43:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-11-12 20:43:33,995 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 167 [2018-11-12 20:43:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:33,996 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-11-12 20:43:33,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-12 20:43:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-11-12 20:43:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-12 20:43:33,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:33,997 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:33,997 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:33,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash -307121854, now seen corresponding path program 5 times [2018-11-12 20:43:33,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:33,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:33,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:34,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:34,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:34,842 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:43:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:34,842 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:43:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:34,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:34,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-12 20:43:34,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:34,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:35,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:38,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 85, 85] total 102 [2018-11-12 20:43:38,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:38,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-12 20:43:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-12 20:43:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:38,362 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 87 states. [2018-11-12 20:43:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:39,737 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2018-11-12 20:43:39,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-12 20:43:39,745 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 173 [2018-11-12 20:43:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:39,746 INFO L225 Difference]: With dead ends: 184 [2018-11-12 20:43:39,746 INFO L226 Difference]: Without dead ends: 181 [2018-11-12 20:43:39,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 214 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13232 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-12 20:43:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-12 20:43:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-12 20:43:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-11-12 20:43:39,754 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 173 [2018-11-12 20:43:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:39,755 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-11-12 20:43:39,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-12 20:43:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-11-12 20:43:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-12 20:43:39,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:39,756 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:39,757 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:39,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash 642351248, now seen corresponding path program 6 times [2018-11-12 20:43:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:39,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:39,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:41,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:41,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:41,171 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:41,171 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:43:41,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:41,171 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:43:41,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:41,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:41,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:41,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:41,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:42,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:44,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 88, 88] total 102 [2018-11-12 20:43:44,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:44,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-12 20:43:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-12 20:43:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:44,394 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 90 states. [2018-11-12 20:43:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:45,800 INFO L93 Difference]: Finished difference Result 190 states and 192 transitions. [2018-11-12 20:43:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-12 20:43:45,801 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 179 [2018-11-12 20:43:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:45,803 INFO L225 Difference]: With dead ends: 190 [2018-11-12 20:43:45,803 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:43:45,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 223 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13967 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:43:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-11-12 20:43:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-12 20:43:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-11-12 20:43:45,812 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 179 [2018-11-12 20:43:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:45,813 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-11-12 20:43:45,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-12 20:43:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-11-12 20:43:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-12 20:43:45,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:45,814 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:45,814 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:45,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1716511394, now seen corresponding path program 7 times [2018-11-12 20:43:45,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:45,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:46,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:46,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:46,829 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:46,829 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:43:46,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:46,830 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:43:46,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:46,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:46,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:48,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:50,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 91, 91] total 102 [2018-11-12 20:43:50,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:50,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-12 20:43:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-12 20:43:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:50,539 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 93 states. [2018-11-12 20:43:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:51,608 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2018-11-12 20:43:51,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-11-12 20:43:51,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 185 [2018-11-12 20:43:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:51,610 INFO L225 Difference]: With dead ends: 196 [2018-11-12 20:43:51,610 INFO L226 Difference]: Without dead ends: 193 [2018-11-12 20:43:51,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 232 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14702 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-12 20:43:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-11-12 20:43:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-12 20:43:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-11-12 20:43:51,619 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 185 [2018-11-12 20:43:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:51,620 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-11-12 20:43:51,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-12 20:43:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-11-12 20:43:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-12 20:43:51,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:51,621 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:51,622 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:51,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1173710764, now seen corresponding path program 8 times [2018-11-12 20:43:51,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:51,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:51,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:51,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:51,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:52,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:52,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:52,602 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:52,602 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:43:52,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:52,602 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:43:52,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:52,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:52,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-12 20:43:52,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:52,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:53,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:56,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:56,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94, 94] total 102 [2018-11-12 20:43:56,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:56,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-12 20:43:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-12 20:43:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:56,081 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 96 states. [2018-11-12 20:43:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:57,167 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-11-12 20:43:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-12 20:43:57,167 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 191 [2018-11-12 20:43:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:57,169 INFO L225 Difference]: With dead ends: 202 [2018-11-12 20:43:57,169 INFO L226 Difference]: Without dead ends: 199 [2018-11-12 20:43:57,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 241 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15437 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:43:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-12 20:43:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-12 20:43:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-12 20:43:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-11-12 20:43:57,178 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 191 [2018-11-12 20:43:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:57,179 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-11-12 20:43:57,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-12 20:43:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-11-12 20:43:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-12 20:43:57,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:57,180 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:57,181 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:57,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497414, now seen corresponding path program 9 times [2018-11-12 20:43:57,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:57,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:57,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:58,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:58,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:58,254 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:58,255 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:43:58,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:58,255 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:43:58,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:58,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:58,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:58,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:58,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:43:59,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:01,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 97, 97] total 102 [2018-11-12 20:44:01,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:01,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-12 20:44:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-12 20:44:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:01,709 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 99 states. [2018-11-12 20:44:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:03,288 INFO L93 Difference]: Finished difference Result 208 states and 210 transitions. [2018-11-12 20:44:03,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-12 20:44:03,289 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 197 [2018-11-12 20:44:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:03,291 INFO L225 Difference]: With dead ends: 208 [2018-11-12 20:44:03,291 INFO L226 Difference]: Without dead ends: 205 [2018-11-12 20:44:03,292 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 250 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16172 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-12 20:44:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-11-12 20:44:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-12 20:44:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-11-12 20:44:03,299 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 197 [2018-11-12 20:44:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:03,299 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-11-12 20:44:03,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-12 20:44:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-11-12 20:44:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-12 20:44:03,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:03,301 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:03,301 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:03,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1907129144, now seen corresponding path program 10 times [2018-11-12 20:44:03,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:03,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:03,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:04,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:04,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:04,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:04,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:04,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:04,358 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:44:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:04,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:44:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:04,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:05,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100, 100] total 102 [2018-11-12 20:44:07,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:07,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-12 20:44:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-12 20:44:07,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:07,795 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 102 states. [2018-11-12 20:44:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:09,065 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-11-12 20:44:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-12 20:44:09,066 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 203 [2018-11-12 20:44:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:09,068 INFO L225 Difference]: With dead ends: 213 [2018-11-12 20:44:09,068 INFO L226 Difference]: Without dead ends: 210 [2018-11-12 20:44:09,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 259 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:44:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-12 20:44:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-12 20:44:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-12 20:44:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-11-12 20:44:09,077 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 203 [2018-11-12 20:44:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:09,078 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-11-12 20:44:09,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-12 20:44:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-11-12 20:44:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 20:44:09,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:09,080 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:09,080 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:09,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2105808790, now seen corresponding path program 11 times [2018-11-12 20:44:09,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:09,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:44:09,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:09,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:11,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:11,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:44:11,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:44:11,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:44:11,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:44:11,142 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:44:11,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:44:11,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:44:11,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-12 20:44:11,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:44:11,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:44:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:11,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:44:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:44:11,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2018-11-12 20:44:11,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:44:11,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:44:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:44:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:44:11,815 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 54 states. [2018-11-12 20:44:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:13,914 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-11-12 20:44:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-12 20:44:13,914 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 209 [2018-11-12 20:44:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:13,916 INFO L225 Difference]: With dead ends: 216 [2018-11-12 20:44:13,916 INFO L226 Difference]: Without dead ends: 213 [2018-11-12 20:44:13,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:44:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-12 20:44:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-11-12 20:44:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-12 20:44:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-11-12 20:44:13,924 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2018-11-12 20:44:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:13,925 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-11-12 20:44:13,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:44:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-11-12 20:44:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 20:44:13,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:44:13,926 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:44:13,926 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:44:13,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:44:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 745125424, now seen corresponding path program 12 times [2018-11-12 20:44:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:44:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:13,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:44:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:44:13,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:44:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:44:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:44:15,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:44:15,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-11-12 20:44:15,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:44:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-12 20:44:15,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-12 20:44:15,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:44:15,184 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 52 states. [2018-11-12 20:44:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:44:15,762 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-11-12 20:44:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-12 20:44:15,763 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2018-11-12 20:44:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:44:15,763 INFO L225 Difference]: With dead ends: 212 [2018-11-12 20:44:15,763 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:44:15,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:44:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:44:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:44:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:44:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:44:15,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-11-12 20:44:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:44:15,766 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:44:15,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-12 20:44:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:44:15,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:44:15,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:44:16,027 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-12 20:44:17,283 WARN L179 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 206 [2018-11-12 20:44:17,864 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:17,864 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:17,864 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:17,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:44:17,865 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:44:17,865 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:44:17,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:44:17,865 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 1253) no Hoare annotation was computed. [2018-11-12 20:44:17,865 INFO L421 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 11) (<= 50 main_~main__y~0) (<= 11 main_~main__x~0)) [2018-11-12 20:44:17,865 INFO L421 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 22) (<= 22 main_~main__x~0)) [2018-11-12 20:44:17,865 INFO L421 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= 33 main_~main__x~0) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 33)) [2018-11-12 20:44:17,865 INFO L421 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 44 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 44)) [2018-11-12 20:44:17,866 INFO L421 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (and (<= 55 main_~main__y~0) (<= main_~main__x~0 55) (<= main_~main__y~0 55) (<= 55 main_~main__x~0)) [2018-11-12 20:44:17,866 INFO L421 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (and (<= main_~main__x~0 66) (<= main_~main__y~0 66) (<= 66 main_~main__y~0) (<= 66 main_~main__x~0)) [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 1253) no Hoare annotation was computed. [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2018-11-12 20:44:17,866 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2018-11-12 20:44:17,867 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 8) (<= 8 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 19) (<= 50 main_~main__y~0) (<= 19 main_~main__x~0)) [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 30) (<= 50 main_~main__y~0) (<= 30 main_~main__x~0)) [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 41) (<= 41 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (and (<= main_~main__x~0 52) (<= main_~main__y~0 52) (<= 52 main_~main__y~0) (<= 52 main_~main__x~0)) [2018-11-12 20:44:17,867 INFO L421 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (and (<= 63 main_~main__x~0) (<= main_~main__y~0 63) (<= main_~main__x~0 63) (<= 63 main_~main__y~0)) [2018-11-12 20:44:17,867 INFO L425 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-11-12 20:44:17,867 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2018-11-12 20:44:17,868 INFO L421 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 5) (<= 5 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,868 INFO L421 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 16) (<= 50 main_~main__y~0) (<= 16 main_~main__x~0)) [2018-11-12 20:44:17,868 INFO L421 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 27 main_~main__x~0) (<= main_~main__x~0 27) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,868 INFO L421 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 38) (<= 38 main_~main__x~0)) [2018-11-12 20:44:17,869 INFO L421 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 49 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 49)) [2018-11-12 20:44:17,869 INFO L421 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (and (<= main_~main__x~0 60) (<= 60 main_~main__x~0) (<= 60 main_~main__y~0) (<= main_~main__y~0 60)) [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2018-11-12 20:44:17,869 INFO L421 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 2 main_~main__x~0) (<= main_~main__x~0 2)) [2018-11-12 20:44:17,870 INFO L421 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 13 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 13)) [2018-11-12 20:44:17,870 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2018-11-12 20:44:17,870 INFO L421 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 24 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 24)) [2018-11-12 20:44:17,870 INFO L421 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 35) (<= 50 main_~main__y~0) (<= 35 main_~main__x~0)) [2018-11-12 20:44:17,870 INFO L421 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 46 main_~main__x~0) (<= main_~main__x~0 46)) [2018-11-12 20:44:17,870 INFO L421 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (and (<= 57 main_~main__y~0) (<= main_~main__y~0 57) (<= 57 main_~main__x~0) (<= main_~main__x~0 57)) [2018-11-12 20:44:17,870 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2018-11-12 20:44:17,870 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2018-11-12 20:44:17,870 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2018-11-12 20:44:17,871 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2018-11-12 20:44:17,871 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2018-11-12 20:44:17,871 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2018-11-12 20:44:17,871 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 10 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 10)) [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 21) (<= 21 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 32) (<= 32 main_~main__x~0)) [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 43) (<= 50 main_~main__y~0) (<= 43 main_~main__x~0)) [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (and (<= main_~main__y~0 54) (<= 54 main_~main__y~0) (<= 54 main_~main__x~0) (<= main_~main__x~0 54)) [2018-11-12 20:44:17,871 INFO L421 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (and (<= main_~main__y~0 65) (<= 65 main_~main__y~0) (<= main_~main__x~0 65) (<= 65 main_~main__x~0)) [2018-11-12 20:44:17,871 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 7) (<= 7 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 18 main_~main__x~0) (<= main_~main__x~0 18) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 29) (<= 29 main_~main__x~0)) [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 40 main_~main__x~0) (<= main_~main__x~0 40) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (and (<= 51 main_~main__y~0) (<= main_~main__x~0 51) (<= 51 main_~main__x~0) (<= main_~main__y~0 51)) [2018-11-12 20:44:17,872 INFO L421 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (and (<= 62 main_~main__y~0) (<= main_~main__y~0 62) (<= 62 main_~main__x~0) (<= main_~main__x~0 62)) [2018-11-12 20:44:17,872 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= main_~main__x~0 4) (<= main_~main__y~0 50) (<= 4 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 15) (<= 15 main_~main__x~0)) [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= main_~main__x~0 26) (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 26 main_~main__x~0)) [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 37) (<= 50 main_~main__y~0) (<= 37 main_~main__x~0)) [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 48 main_~main__x~0) (<= main_~main__x~0 48) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,873 INFO L421 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (and (<= 59 main_~main__x~0) (<= main_~main__y~0 59) (<= main_~main__x~0 59) (<= 59 main_~main__y~0)) [2018-11-12 20:44:17,873 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2018-11-12 20:44:17,874 INFO L421 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 1 main_~main__x~0) (<= main_~main__x~0 1)) [2018-11-12 20:44:17,874 INFO L421 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 12 main_~main__x~0) (<= main_~main__x~0 12)) [2018-11-12 20:44:17,874 INFO L421 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 23) (<= 23 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,874 INFO L421 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 34) (<= 50 main_~main__y~0) (<= 34 main_~main__x~0)) [2018-11-12 20:44:17,875 INFO L421 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 45) (<= 50 main_~main__y~0) (<= 45 main_~main__x~0)) [2018-11-12 20:44:17,875 INFO L421 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (and (<= 56 main_~main__x~0) (<= main_~main__y~0 56) (<= main_~main__x~0 56) (<= 56 main_~main__y~0)) [2018-11-12 20:44:17,875 INFO L421 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (or (and (<= main_~main__y~0 100) (<= 100 main_~main__x~0) (<= 100 main_~main__y~0)) (and (<= main_~main__x~0 95) (<= main_~main__y~0 95) (<= 95 main_~main__x~0) (<= 95 main_~main__y~0)) (and (<= main_~main__x~0 81) (<= main_~main__y~0 81) (<= 81 main_~main__x~0) (<= 81 main_~main__y~0)) (and (<= 87 main_~main__x~0) (<= main_~main__y~0 87) (<= main_~main__x~0 87) (<= 87 main_~main__y~0)) (and (<= main_~main__x~0 91) (<= 91 main_~main__x~0) (<= main_~main__y~0 91) (<= 91 main_~main__y~0)) (and (<= 75 main_~main__y~0) (<= main_~main__x~0 75) (<= 75 main_~main__x~0) (<= main_~main__y~0 75)) (and (<= main_~main__x~0 73) (<= 73 main_~main__x~0) (<= main_~main__y~0 73) (<= 73 main_~main__y~0)) (and (<= main_~main__x~0 96) (<= main_~main__y~0 96) (<= 96 main_~main__y~0) (<= 96 main_~main__x~0)) (and (<= main_~main__x~0 78) (<= main_~main__y~0 78) (<= 78 main_~main__x~0) (<= 78 main_~main__y~0)) (and (<= main_~main__y~0 77) (<= 77 main_~main__y~0) (<= main_~main__x~0 77) (<= 77 main_~main__x~0)) (and (<= main_~main__x~0 92) (<= 92 main_~main__x~0) (<= main_~main__y~0 92) (<= 92 main_~main__y~0)) (and (<= 79 main_~main__x~0) (<= 79 main_~main__y~0) (<= main_~main__x~0 79) (<= main_~main__y~0 79)) (and (<= main_~main__x~0 69) (<= main_~main__y~0 69) (<= 69 main_~main__y~0) (<= 69 main_~main__x~0)) (and (<= main_~main__x~0 93) (<= main_~main__y~0 93) (<= 93 main_~main__y~0) (<= 93 main_~main__x~0)) (and (<= 89 main_~main__y~0) (<= main_~main__y~0 89) (<= main_~main__x~0 89) (<= 89 main_~main__x~0)) (and (<= main_~main__x~0 82) (<= 82 main_~main__x~0) (<= main_~main__y~0 82) (<= 82 main_~main__y~0)) (and (<= main_~main__y~0 90) (<= 90 main_~main__y~0) (<= 90 main_~main__x~0) (<= main_~main__x~0 90)) (and (<= 86 main_~main__x~0) (<= main_~main__x~0 86) (<= main_~main__y~0 86) (<= 86 main_~main__y~0)) (and (<= main_~main__y~0 98) (<= 98 main_~main__y~0) (<= main_~main__x~0 98) (<= 98 main_~main__x~0)) (and (<= main_~main__x~0 99) (<= 99 main_~main__x~0) (<= main_~main__y~0 99) (<= 99 main_~main__y~0)) (and (<= 72 main_~main__x~0) (<= main_~main__y~0 72) (<= 72 main_~main__y~0) (<= main_~main__x~0 72)) (and (<= main_~main__x~0 88) (<= 88 main_~main__x~0) (<= main_~main__y~0 88) (<= 88 main_~main__y~0)) (and (<= main_~main__x~0 94) (<= 94 main_~main__x~0) (<= main_~main__y~0 94) (<= 94 main_~main__y~0)) (and (<= 70 main_~main__x~0) (<= main_~main__y~0 70) (<= main_~main__x~0 70) (<= 70 main_~main__y~0)) (and (<= main_~main__y~0 71) (<= 71 main_~main__y~0) (<= 71 main_~main__x~0) (<= main_~main__x~0 71)) (and (<= 76 main_~main__x~0) (<= main_~main__x~0 76) (<= main_~main__y~0 76) (<= 76 main_~main__y~0)) (and (<= main_~main__y~0 74) (<= 74 main_~main__y~0) (<= main_~main__x~0 74) (<= 74 main_~main__x~0)) (and (<= main_~main__x~0 80) (<= main_~main__y~0 80) (<= 80 main_~main__x~0) (<= 80 main_~main__y~0)) (and (<= 85 main_~main__y~0) (<= main_~main__x~0 85) (<= 85 main_~main__x~0) (<= main_~main__y~0 85)) (and (<= main_~main__y~0 84) (<= 84 main_~main__y~0) (<= 84 main_~main__x~0) (<= main_~main__x~0 84)) (and (<= main_~main__y~0 97) (<= 97 main_~main__x~0) (<= 97 main_~main__y~0) (<= main_~main__x~0 97)) (and (<= main_~main__x~0 67) (<= 67 main_~main__x~0) (<= main_~main__y~0 67) (<= 67 main_~main__y~0)) (and (<= main_~main__y~0 68) (<= 68 main_~main__x~0) (<= main_~main__x~0 68) (<= 68 main_~main__y~0)) (and (<= main_~main__y~0 83) (<= main_~main__x~0 83) (<= 83 main_~main__x~0) (<= 83 main_~main__y~0))) [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2018-11-12 20:44:17,876 INFO L421 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 9) (<= 50 main_~main__y~0) (<= 9 main_~main__x~0)) [2018-11-12 20:44:17,876 INFO L421 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 20) (<= 20 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,877 INFO L421 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 31 main_~main__x~0) (<= main_~main__x~0 31)) [2018-11-12 20:44:17,877 INFO L421 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 42) (<= 42 main_~main__x~0)) [2018-11-12 20:44:17,877 INFO L421 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (and (<= main_~main__y~0 53) (<= 53 main_~main__y~0) (<= main_~main__x~0 53) (<= 53 main_~main__x~0)) [2018-11-12 20:44:17,877 INFO L421 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (and (<= main_~main__y~0 64) (<= main_~main__x~0 64) (<= 64 main_~main__x~0) (<= 64 main_~main__y~0)) [2018-11-12 20:44:17,877 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2018-11-12 20:44:17,877 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2018-11-12 20:44:17,877 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2018-11-12 20:44:17,877 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2018-11-12 20:44:17,877 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2018-11-12 20:44:17,878 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 6 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 6)) [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 17 main_~main__x~0) (<= main_~main__x~0 17) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,878 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 1253) the Hoare annotation is: true [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 28 main_~main__x~0) (<= main_~main__x~0 28)) [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 39 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 39)) [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= main_~main__x~0 50) (<= 50 main_~main__x~0)) [2018-11-12 20:44:17,878 INFO L421 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (and (<= 61 main_~main__y~0) (<= 61 main_~main__x~0) (<= main_~main__y~0 61) (<= main_~main__x~0 61)) [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2018-11-12 20:44:17,879 INFO L421 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 50 main_~main__y~0) (<= 3 main_~main__x~0) (<= main_~main__x~0 3)) [2018-11-12 20:44:17,879 INFO L421 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= 14 main_~main__x~0) (<= 50 main_~main__y~0) (<= main_~main__x~0 14)) [2018-11-12 20:44:17,879 INFO L421 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 25) (<= 25 main_~main__x~0) (<= 50 main_~main__y~0)) [2018-11-12 20:44:17,880 INFO L421 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 36) (<= 50 main_~main__y~0) (<= 36 main_~main__x~0)) [2018-11-12 20:44:17,880 INFO L421 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (<= main_~main__y~0 50) (<= main_~main__x~0 47) (<= 50 main_~main__y~0) (<= 47 main_~main__x~0)) [2018-11-12 20:44:17,880 INFO L421 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (and (<= main_~main__x~0 58) (<= main_~main__y~0 58) (<= 58 main_~main__x~0) (<= 58 main_~main__y~0)) [2018-11-12 20:44:17,880 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2018-11-12 20:44:17,880 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2018-11-12 20:44:17,880 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2018-11-12 20:44:17,880 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2018-11-12 20:44:17,880 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2018-11-12 20:44:17,881 INFO L425 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2018-11-12 20:44:17,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:44:17 BoogieIcfgContainer [2018-11-12 20:44:17,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:44:17,921 INFO L168 Benchmark]: Toolchain (without parser) took 146792.29 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 997.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -924.6 MB). Peak memory consumption was 919.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:17,923 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:44:17,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.29 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:17,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.64 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:44:17,924 INFO L168 Benchmark]: Boogie Preprocessor took 122.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.5 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:17,925 INFO L168 Benchmark]: RCFGBuilder took 1519.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:17,926 INFO L168 Benchmark]: TraceAbstraction took 144549.39 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 290.5 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -238.0 MB). Peak memory consumption was 899.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:44:17,930 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 566.29 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.64 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 122.84 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.5 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1519.23 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.8 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144549.39 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 290.5 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -238.0 MB). Peak memory consumption was 899.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 8) && 8 <= main__x) && 50 <= main__y - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 40 <= main__x) && main__x <= 40) && 50 <= main__y - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 1 <= main__x) && main__x <= 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((33 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 33 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((61 <= main__y && 61 <= main__x) && main__y <= 61) && main__x <= 61 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((main__x <= 26 && main__y <= 50) && 50 <= main__y) && 26 <= main__x - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 19) && 50 <= main__y) && 19 <= main__x - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((51 <= main__y && main__x <= 51) && 51 <= main__x) && main__y <= 51 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 12 <= main__x) && main__x <= 12 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 44 <= main__x) && 50 <= main__y) && main__x <= 44 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 5) && 5 <= main__x) && 50 <= main__y - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 37) && 50 <= main__y) && 37 <= main__x - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((57 <= main__y && main__y <= 57) && 57 <= main__x) && main__x <= 57 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 30) && 50 <= main__y) && 30 <= main__x - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((main__y <= 64 && main__x <= 64) && 64 <= main__x) && 64 <= main__y - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 23) && 23 <= main__x) && 50 <= main__y - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((55 <= main__y && main__x <= 55) && main__y <= 55) && 55 <= main__x - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 16) && 50 <= main__y) && 16 <= main__x - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 48 <= main__x) && main__x <= 48) && 50 <= main__y - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 9) && 50 <= main__y) && 9 <= main__x - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 41) && 41 <= main__x) && 50 <= main__y - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 2 <= main__x) && main__x <= 2 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 34) && 50 <= main__y) && 34 <= main__x - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((main__x <= 60 && 60 <= main__x) && 60 <= main__y) && main__y <= 60 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 27 <= main__x) && main__x <= 27) && 50 <= main__y - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((main__y <= 100 && 100 <= main__x) && 100 <= main__y) || (((main__x <= 95 && main__y <= 95) && 95 <= main__x) && 95 <= main__y)) || (((main__x <= 81 && main__y <= 81) && 81 <= main__x) && 81 <= main__y)) || (((87 <= main__x && main__y <= 87) && main__x <= 87) && 87 <= main__y)) || (((main__x <= 91 && 91 <= main__x) && main__y <= 91) && 91 <= main__y)) || (((75 <= main__y && main__x <= 75) && 75 <= main__x) && main__y <= 75)) || (((main__x <= 73 && 73 <= main__x) && main__y <= 73) && 73 <= main__y)) || (((main__x <= 96 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x <= 78 && main__y <= 78) && 78 <= main__x) && 78 <= main__y)) || (((main__y <= 77 && 77 <= main__y) && main__x <= 77) && 77 <= main__x)) || (((main__x <= 92 && 92 <= main__x) && main__y <= 92) && 92 <= main__y)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__x <= 69 && main__y <= 69) && 69 <= main__y) && 69 <= main__x)) || (((main__x <= 93 && main__y <= 93) && 93 <= main__y) && 93 <= main__x)) || (((89 <= main__y && main__y <= 89) && main__x <= 89) && 89 <= main__x)) || (((main__x <= 82 && 82 <= main__x) && main__y <= 82) && 82 <= main__y)) || (((main__y <= 90 && 90 <= main__y) && 90 <= main__x) && main__x <= 90)) || (((86 <= main__x && main__x <= 86) && main__y <= 86) && 86 <= main__y)) || (((main__y <= 98 && 98 <= main__y) && main__x <= 98) && 98 <= main__x)) || (((main__x <= 99 && 99 <= main__x) && main__y <= 99) && 99 <= main__y)) || (((72 <= main__x && main__y <= 72) && 72 <= main__y) && main__x <= 72)) || (((main__x <= 88 && 88 <= main__x) && main__y <= 88) && 88 <= main__y)) || (((main__x <= 94 && 94 <= main__x) && main__y <= 94) && 94 <= main__y)) || (((70 <= main__x && main__y <= 70) && main__x <= 70) && 70 <= main__y)) || (((main__y <= 71 && 71 <= main__y) && 71 <= main__x) && main__x <= 71)) || (((76 <= main__x && main__x <= 76) && main__y <= 76) && 76 <= main__y)) || (((main__y <= 74 && 74 <= main__y) && main__x <= 74) && 74 <= main__x)) || (((main__x <= 80 && main__y <= 80) && 80 <= main__x) && 80 <= main__y)) || (((85 <= main__y && main__x <= 85) && 85 <= main__x) && main__y <= 85)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((main__y <= 97 && 97 <= main__x) && 97 <= main__y) && main__x <= 97)) || (((main__x <= 67 && 67 <= main__x) && main__y <= 67) && 67 <= main__y)) || (((main__y <= 68 && 68 <= main__x) && main__x <= 68) && 68 <= main__y)) || (((main__y <= 83 && main__x <= 83) && 83 <= main__x) && 83 <= main__y) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 20) && 20 <= main__x) && 50 <= main__y - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: ((main__x <= 52 && main__y <= 52) && 52 <= main__y) && 52 <= main__x - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 13 <= main__x) && 50 <= main__y) && main__x <= 13 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 45) && 50 <= main__y) && 45 <= main__x - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 6 <= main__x) && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 38) && 38 <= main__x - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((56 <= main__x && main__y <= 56) && main__x <= 56) && 56 <= main__y - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 31 <= main__x) && main__x <= 31 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((63 <= main__x && main__y <= 63) && main__x <= 63) && 63 <= main__y - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 24 <= main__x) && 50 <= main__y) && main__x <= 24 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 17 <= main__x) && main__x <= 17) && 50 <= main__y - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 49 <= main__x) && 50 <= main__y) && main__x <= 49 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 10 <= main__x) && 50 <= main__y) && main__x <= 10 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 42) && 42 <= main__x - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 3 <= main__x) && main__x <= 3 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 35) && 50 <= main__y) && 35 <= main__x - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((59 <= main__x && main__y <= 59) && main__x <= 59) && 59 <= main__y - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 28 <= main__x) && main__x <= 28 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 21) && 21 <= main__x) && 50 <= main__y - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((main__y <= 53 && 53 <= main__y) && main__x <= 53) && 53 <= main__x - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 14 <= main__x) && 50 <= main__y) && main__x <= 14 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 46 <= main__x) && main__x <= 46 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 7) && 7 <= main__x) && 50 <= main__y - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 39 <= main__x) && 50 <= main__y) && main__x <= 39 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 32) && 32 <= main__x - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((62 <= main__y && main__y <= 62) && 62 <= main__x) && main__x <= 62 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 25) && 25 <= main__x) && 50 <= main__y - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 18 <= main__x) && main__x <= 18) && 50 <= main__y - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 50) && 50 <= main__x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 11) && 50 <= main__y) && 11 <= main__x - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 43) && 50 <= main__y) && 43 <= main__x - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__x <= 4 && main__y <= 50) && 4 <= main__x) && 50 <= main__y - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 36) && 50 <= main__y) && 36 <= main__x - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 29) && 29 <= main__x - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((main__y <= 65 && 65 <= main__y) && main__x <= 65) && 65 <= main__x - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 22) && 22 <= main__x - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((main__y <= 54 && 54 <= main__y) && 54 <= main__x) && main__x <= 54 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 15) && 15 <= main__x - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 47) && 50 <= main__y) && 47 <= main__x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 144.4s OverallTime, 41 OverallIterations, 34 TraceHistogramMax, 65.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3979 SDtfs, 5134 SDslu, 14090 SDs, 0 SdLazy, 87977 SolverSat, 5067 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5239 GetRequests, 2661 SyntacticMatches, 712 SemanticMatches, 1866 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135995 ImplicationChecksByTransitivity, 69.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 41 MinimizatonAttempts, 13 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 171 NumberOfFragments, 1302 HoareAnnotationTreeSize, 71 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 71 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 72.7s InterpolantComputationTime, 8300 NumberOfCodeBlocks, 8300 NumberOfCodeBlocksAsserted, 133 NumberOfCheckSat, 10206 ConstructedInterpolants, 0 QuantifiedInterpolants, 4362192 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4884 ConjunctsInSsa, 963 ConjunctsInUnsatCore, 63 InterpolantComputations, 30 PerfectInterpolantSequences, 1160/14822 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...