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/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label15_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:51,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:51,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:51,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:51,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:51,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:51,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:51,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:51,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:51,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:51,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:51,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:51,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:51,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:51,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:51,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:51,489 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:51,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:51,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:51,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:51,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:51,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:51,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:51,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:51,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:51,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:51,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:51,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:51,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:51,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:51,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:51,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:51,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:51,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:51,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:51,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:51,531 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:52:51,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:51,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:51,564 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:51,564 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:51,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:51,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:51,565 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:51,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:51,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:51,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:51,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:51,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:51,567 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:51,567 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:51,567 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:51,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:51,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:51,568 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:51,568 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:51,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:51,568 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:51,569 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:51,569 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:51,569 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:51,569 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:51,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:51,570 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:51,570 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:51,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:51,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:51,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:51,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:51,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:51,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label15_true-unreach-call.c [2018-11-06 19:52:51,708 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2707a67/d5542c52411a476c8eb937121eb96c87/FLAGe86a6e284 [2018-11-06 19:52:52,371 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:52,373 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label15_true-unreach-call.c [2018-11-06 19:52:52,393 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2707a67/d5542c52411a476c8eb937121eb96c87/FLAGe86a6e284 [2018-11-06 19:52:52,416 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2707a67/d5542c52411a476c8eb937121eb96c87 [2018-11-06 19:52:52,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:52,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:52,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:52,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:52,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:52,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:52" (1/1) ... [2018-11-06 19:52:52,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:52, skipping insertion in model container [2018-11-06 19:52:52,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:52" (1/1) ... [2018-11-06 19:52:52,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:52,547 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:53,260 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:53,265 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:53,550 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:53,588 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:53,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53 WrapperNode [2018-11-06 19:52:53,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:53,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:53,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:53,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:53,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:53,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:53,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:53,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:53,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:53,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:54,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (1/1) ... [2018-11-06 19:52:54,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:54,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:54,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:54,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:54,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (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-06 19:52:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:59,277 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:59,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:59 BoogieIcfgContainer [2018-11-06 19:52:59,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:59,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:59,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:59,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:59,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:52" (1/3) ... [2018-11-06 19:52:59,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:59, skipping insertion in model container [2018-11-06 19:52:59,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:53" (2/3) ... [2018-11-06 19:52:59,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64758d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:59, skipping insertion in model container [2018-11-06 19:52:59,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:59" (3/3) ... [2018-11-06 19:52:59,286 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label15_true-unreach-call.c [2018-11-06 19:52:59,297 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:59,306 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:59,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:59,360 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:59,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:59,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:59,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:59,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:59,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:59,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:59,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:59,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 19:52:59,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:59,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:52:59,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:59,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 351494562, now seen corresponding path program 1 times [2018-11-06 19:52:59,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:59,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:00,507 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-06 19:53:00,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:00,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:00,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:00,539 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:53:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:04,029 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-11-06 19:53:04,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:04,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 19:53:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:04,056 INFO L225 Difference]: With dead ends: 1075 [2018-11-06 19:53:04,057 INFO L226 Difference]: Without dead ends: 765 [2018-11-06 19:53:04,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-06 19:53:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-11-06 19:53:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-06 19:53:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-11-06 19:53:04,147 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 201 [2018-11-06 19:53:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:04,148 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-11-06 19:53:04,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-11-06 19:53:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:53:04,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:04,157 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:04,158 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:04,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1470183811, now seen corresponding path program 1 times [2018-11-06 19:53:04,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:04,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:04,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:04,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:04,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:04,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:04,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:04,315 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-11-06 19:53:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:06,396 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-11-06 19:53:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:06,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-06 19:53:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:06,408 INFO L225 Difference]: With dead ends: 1465 [2018-11-06 19:53:06,408 INFO L226 Difference]: Without dead ends: 947 [2018-11-06 19:53:06,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:53:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-11-06 19:53:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-11-06 19:53:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-11-06 19:53:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-11-06 19:53:06,472 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 210 [2018-11-06 19:53:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:06,472 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-11-06 19:53:06,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-11-06 19:53:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:53:06,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:06,477 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:06,478 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:06,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1114718161, now seen corresponding path program 1 times [2018-11-06 19:53:06,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:06,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:06,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:06,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:06,756 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-11-06 19:53:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:11,071 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-11-06 19:53:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:11,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:53:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:11,082 INFO L225 Difference]: With dead ends: 2683 [2018-11-06 19:53:11,083 INFO L226 Difference]: Without dead ends: 1754 [2018-11-06 19:53:11,085 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-06 19:53:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-11-06 19:53:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-11-06 19:53:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-06 19:53:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-11-06 19:53:11,122 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 218 [2018-11-06 19:53:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-11-06 19:53:11,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-11-06 19:53:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-06 19:53:11,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:11,129 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:11,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:11,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -290151127, now seen corresponding path program 1 times [2018-11-06 19:53:11,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:11,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:11,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:11,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:11,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:11,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:11,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:11,278 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-11-06 19:53:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:12,744 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-11-06 19:53:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:12,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-06 19:53:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:12,760 INFO L225 Difference]: With dead ends: 5139 [2018-11-06 19:53:12,760 INFO L226 Difference]: Without dead ends: 3388 [2018-11-06 19:53:12,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-11-06 19:53:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-11-06 19:53:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-11-06 19:53:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-11-06 19:53:12,826 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 225 [2018-11-06 19:53:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:12,826 INFO L480 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-11-06 19:53:12,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-11-06 19:53:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-06 19:53:12,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:12,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:12,837 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:12,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1890312905, now seen corresponding path program 1 times [2018-11-06 19:53:12,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:12,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:13,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:13,154 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-11-06 19:53:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:16,329 INFO L93 Difference]: Finished difference Result 13364 states and 18287 transitions. [2018-11-06 19:53:16,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:16,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-11-06 19:53:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:16,367 INFO L225 Difference]: With dead ends: 13364 [2018-11-06 19:53:16,368 INFO L226 Difference]: Without dead ends: 9981 [2018-11-06 19:53:16,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2018-11-06 19:53:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 6649. [2018-11-06 19:53:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:53:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-11-06 19:53:16,523 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 228 [2018-11-06 19:53:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:16,524 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-11-06 19:53:16,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-11-06 19:53:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-06 19:53:16,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:16,541 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:16,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:16,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1887742024, now seen corresponding path program 1 times [2018-11-06 19:53:16,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:16,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:16,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:16,852 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-11-06 19:53:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:18,732 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-11-06 19:53:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:18,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-11-06 19:53:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:18,767 INFO L225 Difference]: With dead ends: 16563 [2018-11-06 19:53:18,767 INFO L226 Difference]: Without dead ends: 9916 [2018-11-06 19:53:18,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-11-06 19:53:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-11-06 19:53:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-11-06 19:53:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-11-06 19:53:18,943 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 229 [2018-11-06 19:53:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:18,944 INFO L480 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-11-06 19:53:18,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-11-06 19:53:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-06 19:53:18,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:18,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:18,967 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:18,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:18,967 INFO L82 PathProgramCache]: Analyzing trace with hash 271299164, now seen corresponding path program 1 times [2018-11-06 19:53:18,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:18,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:19,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:19,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:19,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:19,198 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-11-06 19:53:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:20,969 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-11-06 19:53:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:20,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-06 19:53:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:20,999 INFO L225 Difference]: With dead ends: 24787 [2018-11-06 19:53:21,000 INFO L226 Difference]: Without dead ends: 14876 [2018-11-06 19:53:21,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-11-06 19:53:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-11-06 19:53:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-11-06 19:53:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-11-06 19:53:21,214 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 230 [2018-11-06 19:53:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:21,214 INFO L480 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-11-06 19:53:21,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-11-06 19:53:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-06 19:53:21,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:21,243 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:21,243 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:21,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -992007416, now seen corresponding path program 1 times [2018-11-06 19:53:21,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:21,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:21,544 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-06 19:53:21,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:21,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 19:53:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:21,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:53:21,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:21,855 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 6 states. [2018-11-06 19:53:22,046 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-06 19:53:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:30,377 INFO L93 Difference]: Finished difference Result 110182 states and 137504 transitions. [2018-11-06 19:53:30,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 19:53:30,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2018-11-06 19:53:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:30,577 INFO L225 Difference]: With dead ends: 110182 [2018-11-06 19:53:30,577 INFO L226 Difference]: Without dead ends: 95313 [2018-11-06 19:53:30,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:53:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95313 states. [2018-11-06 19:53:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95313 to 95244. [2018-11-06 19:53:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95244 states. [2018-11-06 19:53:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95244 states to 95244 states and 113463 transitions. [2018-11-06 19:53:32,233 INFO L78 Accepts]: Start accepts. Automaton has 95244 states and 113463 transitions. Word has length 238 [2018-11-06 19:53:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 95244 states and 113463 transitions. [2018-11-06 19:53:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 95244 states and 113463 transitions. [2018-11-06 19:53:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-06 19:53:32,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:32,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:32,352 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:32,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1667576599, now seen corresponding path program 1 times [2018-11-06 19:53:32,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:32,618 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:53:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-06 19:53:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:32,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:32,991 INFO L87 Difference]: Start difference. First operand 95244 states and 113463 transitions. Second operand 4 states. [2018-11-06 19:53:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:35,440 INFO L93 Difference]: Finished difference Result 190535 states and 227017 transitions. [2018-11-06 19:53:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:35,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-06 19:53:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:35,583 INFO L225 Difference]: With dead ends: 190535 [2018-11-06 19:53:35,584 INFO L226 Difference]: Without dead ends: 95293 [2018-11-06 19:53:35,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95293 states. [2018-11-06 19:53:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95293 to 95244. [2018-11-06 19:53:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95244 states. [2018-11-06 19:53:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95244 states to 95244 states and 111971 transitions. [2018-11-06 19:53:36,857 INFO L78 Accepts]: Start accepts. Automaton has 95244 states and 111971 transitions. Word has length 267 [2018-11-06 19:53:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:36,857 INFO L480 AbstractCegarLoop]: Abstraction has 95244 states and 111971 transitions. [2018-11-06 19:53:36,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 95244 states and 111971 transitions. [2018-11-06 19:53:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-06 19:53:36,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:36,925 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:36,925 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 59492697, now seen corresponding path program 1 times [2018-11-06 19:53:36,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:36,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:36,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-06 19:53:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:37,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:37,501 INFO L87 Difference]: Start difference. First operand 95244 states and 111971 transitions. Second operand 3 states. [2018-11-06 19:53:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:38,764 INFO L93 Difference]: Finished difference Result 188952 states and 222033 transitions. [2018-11-06 19:53:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:38,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-11-06 19:53:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:38,881 INFO L225 Difference]: With dead ends: 188952 [2018-11-06 19:53:38,881 INFO L226 Difference]: Without dead ends: 93710 [2018-11-06 19:53:38,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:53:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93710 states. [2018-11-06 19:53:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93710 to 83870. [2018-11-06 19:53:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83870 states. [2018-11-06 19:53:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83870 states to 83870 states and 97057 transitions. [2018-11-06 19:53:39,855 INFO L78 Accepts]: Start accepts. Automaton has 83870 states and 97057 transitions. Word has length 267 [2018-11-06 19:53:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:39,856 INFO L480 AbstractCegarLoop]: Abstraction has 83870 states and 97057 transitions. [2018-11-06 19:53:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83870 states and 97057 transitions. [2018-11-06 19:53:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-06 19:53:39,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:39,887 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:39,887 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:39,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:39,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1936354251, now seen corresponding path program 1 times [2018-11-06 19:53:39,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:39,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:39,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:39,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:39,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 19:53:40,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:40,183 INFO L87 Difference]: Start difference. First operand 83870 states and 97057 transitions. Second operand 4 states. [2018-11-06 19:53:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:42,355 INFO L93 Difference]: Finished difference Result 165893 states and 192110 transitions. [2018-11-06 19:53:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:42,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-11-06 19:53:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:42,455 INFO L225 Difference]: With dead ends: 165893 [2018-11-06 19:53:42,456 INFO L226 Difference]: Without dead ends: 82025 [2018-11-06 19:53:42,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82025 states. [2018-11-06 19:53:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82025 to 82025. [2018-11-06 19:53:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82025 states. [2018-11-06 19:53:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82025 states to 82025 states and 91186 transitions. [2018-11-06 19:53:43,853 INFO L78 Accepts]: Start accepts. Automaton has 82025 states and 91186 transitions. Word has length 279 [2018-11-06 19:53:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:43,853 INFO L480 AbstractCegarLoop]: Abstraction has 82025 states and 91186 transitions. [2018-11-06 19:53:43,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 82025 states and 91186 transitions. [2018-11-06 19:53:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-06 19:53:43,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:43,882 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:53:43,882 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:43,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 763990160, now seen corresponding path program 1 times [2018-11-06 19:53:43,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:43,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 19:53:44,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:44,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:53:44,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:53:44,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:53:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:44,236 INFO L87 Difference]: Start difference. First operand 82025 states and 91186 transitions. Second operand 5 states. [2018-11-06 19:53:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:48,169 INFO L93 Difference]: Finished difference Result 396574 states and 439228 transitions. [2018-11-06 19:53:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:53:48,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2018-11-06 19:53:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:49,587 INFO L225 Difference]: With dead ends: 396574 [2018-11-06 19:53:49,588 INFO L226 Difference]: Without dead ends: 314551 [2018-11-06 19:53:49,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:53:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314551 states. [2018-11-06 19:53:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314551 to 235184. [2018-11-06 19:53:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235184 states. [2018-11-06 19:53:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235184 states to 235184 states and 259632 transitions. [2018-11-06 19:53:52,310 INFO L78 Accepts]: Start accepts. Automaton has 235184 states and 259632 transitions. Word has length 281 [2018-11-06 19:53:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:52,310 INFO L480 AbstractCegarLoop]: Abstraction has 235184 states and 259632 transitions. [2018-11-06 19:53:52,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:53:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 235184 states and 259632 transitions. [2018-11-06 19:53:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-06 19:53:52,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:52,331 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:53:52,331 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:52,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2105506147, now seen corresponding path program 1 times [2018-11-06 19:53:52,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:52,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:53,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:53:53,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:53,820 INFO L87 Difference]: Start difference. First operand 235184 states and 259632 transitions. Second operand 6 states. [2018-11-06 19:53:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:59,646 INFO L93 Difference]: Finished difference Result 894571 states and 978664 transitions. [2018-11-06 19:53:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:53:59,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-11-06 19:53:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:00,432 INFO L225 Difference]: With dead ends: 894571 [2018-11-06 19:54:00,432 INFO L226 Difference]: Without dead ends: 659389 [2018-11-06 19:54:00,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:54:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659389 states. [2018-11-06 19:54:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659389 to 659372. [2018-11-06 19:54:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659372 states. [2018-11-06 19:54:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659372 states to 659372 states and 717988 transitions. [2018-11-06 19:54:16,410 INFO L78 Accepts]: Start accepts. Automaton has 659372 states and 717988 transitions. Word has length 282 [2018-11-06 19:54:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:16,410 INFO L480 AbstractCegarLoop]: Abstraction has 659372 states and 717988 transitions. [2018-11-06 19:54:16,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:54:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 659372 states and 717988 transitions. [2018-11-06 19:54:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-06 19:54:16,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:16,441 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-06 19:54:16,441 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:16,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -988579072, now seen corresponding path program 1 times [2018-11-06 19:54:16,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-06 19:54:18,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:18,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:18,286 INFO L87 Difference]: Start difference. First operand 659372 states and 717988 transitions. Second operand 3 states. [2018-11-06 19:54:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:24,989 INFO L93 Difference]: Finished difference Result 1201977 states and 1308551 transitions. [2018-11-06 19:54:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:24,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-06 19:54:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:25,751 INFO L225 Difference]: With dead ends: 1201977 [2018-11-06 19:54:25,752 INFO L226 Difference]: Without dead ends: 542607 [2018-11-06 19:54:25,974 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-06 19:54:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542607 states. [2018-11-06 19:54:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542607 to 529239. [2018-11-06 19:54:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529239 states. [2018-11-06 19:54:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529239 states to 529239 states and 569335 transitions. [2018-11-06 19:54:43,774 INFO L78 Accepts]: Start accepts. Automaton has 529239 states and 569335 transitions. Word has length 314 [2018-11-06 19:54:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:43,775 INFO L480 AbstractCegarLoop]: Abstraction has 529239 states and 569335 transitions. [2018-11-06 19:54:43,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 529239 states and 569335 transitions. [2018-11-06 19:54:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-06 19:54:43,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:43,808 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:54:43,808 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:43,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1862321557, now seen corresponding path program 1 times [2018-11-06 19:54:43,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-06 19:54:44,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:54:44,312 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-06 19:54:44,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:44,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:54:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 48 proven. 108 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-06 19:54:44,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 19:54:44,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 19:54:44,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:54:44,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:54:44,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:54:44,649 INFO L87 Difference]: Start difference. First operand 529239 states and 569335 transitions. Second operand 9 states. [2018-11-06 19:55:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:13,618 INFO L93 Difference]: Finished difference Result 3441653 states and 3688078 transitions. [2018-11-06 19:55:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-06 19:55:13,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 326 [2018-11-06 19:55:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:18,041 INFO L225 Difference]: With dead ends: 3441653 [2018-11-06 19:55:18,041 INFO L226 Difference]: Without dead ends: 2912416 [2018-11-06 19:55:36,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2018-11-06 19:55:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912416 states. [2018-11-06 19:56:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912416 to 1779970. [2018-11-06 19:56:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779970 states.