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_label45_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 18:20:26,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 18:20:26,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 18:20:26,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 18:20:26,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 18:20:26,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 18:20:26,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 18:20:26,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 18:20:26,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 18:20:26,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 18:20:26,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 18:20:26,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 18:20:26,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 18:20:26,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 18:20:26,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 18:20:26,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 18:20:26,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 18:20:26,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 18:20:26,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 18:20:26,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 18:20:26,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 18:20:26,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 18:20:26,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 18:20:26,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 18:20:26,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 18:20:26,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 18:20:26,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 18:20:26,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 18:20:26,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 18:20:26,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 18:20:26,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 18:20:26,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 18:20:26,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 18:20:26,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 18:20:26,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 18:20:26,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 18:20:26,439 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 18:20:26,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 18:20:26,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 18:20:26,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 18:20:26,470 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 18:20:26,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 18:20:26,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 18:20:26,474 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 18:20:26,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 18:20:26,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 18:20:26,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 18:20:26,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 18:20:26,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 18:20:26,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 18:20:26,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 18:20:26,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 18:20:26,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 18:20:26,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 18:20:26,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 18:20:26,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 18:20:26,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 18:20:26,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 18:20:26,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 18:20:26,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 18:20:26,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 18:20:26,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 18:20:26,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 18:20:26,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 18:20:26,479 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 18:20:26,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 18:20:26,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 18:20:26,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 18:20:26,564 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 18:20:26,564 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 18:20:26,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label45_false-unreach-call.c [2018-11-06 18:20:26,631 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef5fce23/e3fc1016585940ea84be5b4633f15139/FLAGd7b7ee01f [2018-11-06 18:20:27,314 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 18:20:27,315 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label45_false-unreach-call.c [2018-11-06 18:20:27,338 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef5fce23/e3fc1016585940ea84be5b4633f15139/FLAGd7b7ee01f [2018-11-06 18:20:27,355 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef5fce23/e3fc1016585940ea84be5b4633f15139 [2018-11-06 18:20:27,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 18:20:27,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 18:20:27,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 18:20:27,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 18:20:27,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 18:20:27,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:20:27" (1/1) ... [2018-11-06 18:20:27,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ab8b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:27, skipping insertion in model container [2018-11-06 18:20:27,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:20:27" (1/1) ... [2018-11-06 18:20:27,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 18:20:27,493 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 18:20:28,326 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 18:20:28,332 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 18:20:28,558 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 18:20:28,582 INFO L193 MainTranslator]: Completed translation [2018-11-06 18:20:28,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28 WrapperNode [2018-11-06 18:20:28,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 18:20:28,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 18:20:28,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 18:20:28,585 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 18:20:28,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 18:20:28,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 18:20:28,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 18:20:28,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 18:20:28,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:28,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:29,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:29,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (1/1) ... [2018-11-06 18:20:29,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 18:20:29,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 18:20:29,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 18:20:29,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 18:20:29,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (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 18:20:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 18:20:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 18:20:29,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 18:20:34,666 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 18:20:34,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:20:34 BoogieIcfgContainer [2018-11-06 18:20:34,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 18:20:34,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 18:20:34,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 18:20:34,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 18:20:34,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:20:27" (1/3) ... [2018-11-06 18:20:34,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e578838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:20:34, skipping insertion in model container [2018-11-06 18:20:34,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:20:28" (2/3) ... [2018-11-06 18:20:34,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e578838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:20:34, skipping insertion in model container [2018-11-06 18:20:34,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:20:34" (3/3) ... [2018-11-06 18:20:34,676 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label45_false-unreach-call.c [2018-11-06 18:20:34,686 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 18:20:34,695 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 18:20:34,714 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 18:20:34,761 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 18:20:34,762 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 18:20:34,762 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 18:20:34,762 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 18:20:34,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 18:20:34,763 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 18:20:34,763 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 18:20:34,763 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 18:20:34,763 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 18:20:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 18:20:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-06 18:20:34,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:34,816 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] [2018-11-06 18:20:34,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1272460738, now seen corresponding path program 1 times [2018-11-06 18:20:34,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:34,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:34,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:34,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:35,603 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 18:20:35,684 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 18:20:35,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:35,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:20:35,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:20:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:20:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:20:35,713 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 18:20:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:38,800 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-11-06 18:20:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:20:38,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-11-06 18:20:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:38,833 INFO L225 Difference]: With dead ends: 1072 [2018-11-06 18:20:38,834 INFO L226 Difference]: Without dead ends: 762 [2018-11-06 18:20:38,839 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 18:20:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-06 18:20:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-11-06 18:20:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-06 18:20:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-11-06 18:20:39,020 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 145 [2018-11-06 18:20:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:39,021 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-11-06 18:20:39,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:20:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-11-06 18:20:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-06 18:20:39,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:39,028 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-06 18:20:39,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:39,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1408994801, now seen corresponding path program 1 times [2018-11-06 18:20:39,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:39,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 18:20:39,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:39,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:20:39,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:20:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:20:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:20:39,347 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-11-06 18:20:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:42,664 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-11-06 18:20:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:20:42,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-06 18:20:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:42,677 INFO L225 Difference]: With dead ends: 1918 [2018-11-06 18:20:42,677 INFO L226 Difference]: Without dead ends: 1402 [2018-11-06 18:20:42,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 18:20:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-11-06 18:20:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-11-06 18:20:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-06 18:20:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-11-06 18:20:42,720 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 151 [2018-11-06 18:20:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:42,721 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-11-06 18:20:42,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:20:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-11-06 18:20:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 18:20:42,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:42,735 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] [2018-11-06 18:20:42,735 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:42,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 470557859, now seen corresponding path program 1 times [2018-11-06 18:20:42,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:42,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:42,844 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 18:20:42,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:42,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:20:42,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:20:42,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:20:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:20:42,846 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-11-06 18:20:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:47,938 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-11-06 18:20:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:20:47,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-06 18:20:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:47,949 INFO L225 Difference]: With dead ends: 2699 [2018-11-06 18:20:47,950 INFO L226 Difference]: Without dead ends: 1768 [2018-11-06 18:20:47,952 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 18:20:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-11-06 18:20:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-11-06 18:20:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-11-06 18:20:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-11-06 18:20:47,991 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 154 [2018-11-06 18:20:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:47,992 INFO L480 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-11-06 18:20:47,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:20:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-11-06 18:20:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-06 18:20:47,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:47,997 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-06 18:20:47,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:47,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash 970264919, now seen corresponding path program 1 times [2018-11-06 18:20:47,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:47,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-06 18:20:48,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:48,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:20:48,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:20:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:20:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:20:48,147 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-11-06 18:20:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:49,388 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-11-06 18:20:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:20:49,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-06 18:20:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:49,403 INFO L225 Difference]: With dead ends: 4329 [2018-11-06 18:20:49,404 INFO L226 Difference]: Without dead ends: 2580 [2018-11-06 18:20:49,407 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 18:20:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-11-06 18:20:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-11-06 18:20:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-11-06 18:20:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-11-06 18:20:49,519 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 162 [2018-11-06 18:20:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:49,520 INFO L480 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-11-06 18:20:49,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:20:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-11-06 18:20:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-06 18:20:49,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:49,526 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2018-11-06 18:20:49,526 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:49,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1840830910, now seen corresponding path program 1 times [2018-11-06 18:20:49,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:49,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 18:20:49,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:49,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:20:49,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:20:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:20:49,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:20:49,677 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-11-06 18:20:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:50,329 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-11-06 18:20:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:20:50,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-06 18:20:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:50,356 INFO L225 Difference]: With dead ends: 7713 [2018-11-06 18:20:50,356 INFO L226 Difference]: Without dead ends: 5136 [2018-11-06 18:20:50,361 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 18:20:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-11-06 18:20:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-11-06 18:20:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-11-06 18:20:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-11-06 18:20:50,454 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 168 [2018-11-06 18:20:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:50,455 INFO L480 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-11-06 18:20:50,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:20:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-11-06 18:20:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-06 18:20:50,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:50,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-06 18:20:50,464 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:50,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1874553211, now seen corresponding path program 1 times [2018-11-06 18:20:50,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-06 18:20:50,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 18:20:50,676 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 18:20:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:50,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 18:20:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 18:20:50,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 18:20:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 18:20:50,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:20:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:20:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:20:50,927 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-11-06 18:20:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:53,036 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-11-06 18:20:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:20:53,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-11-06 18:20:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:53,116 INFO L225 Difference]: With dead ends: 20487 [2018-11-06 18:20:53,117 INFO L226 Difference]: Without dead ends: 15356 [2018-11-06 18:20:53,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 1 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 18:20:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-11-06 18:20:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-11-06 18:20:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-11-06 18:20:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-11-06 18:20:53,374 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 177 [2018-11-06 18:20:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-11-06 18:20:53,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:20:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-11-06 18:20:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 18:20:53,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:53,390 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, 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] [2018-11-06 18:20:53,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:53,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 598732614, now seen corresponding path program 1 times [2018-11-06 18:20:53,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:53,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 18:20:53,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:53,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 18:20:53,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 18:20:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 18:20:53,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 18:20:53,838 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-11-06 18:20:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:57,043 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-11-06 18:20:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 18:20:57,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-11-06 18:20:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:57,082 INFO L225 Difference]: With dead ends: 23029 [2018-11-06 18:20:57,083 INFO L226 Difference]: Without dead ends: 12802 [2018-11-06 18:20:57,099 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 18:20:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-11-06 18:20:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-11-06 18:20:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-11-06 18:20:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-11-06 18:20:57,456 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 185 [2018-11-06 18:20:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:20:57,457 INFO L480 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-11-06 18:20:57,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 18:20:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-11-06 18:20:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 18:20:57,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:20:57,472 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-06 18:20:57,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:20:57,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:20:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1720192058, now seen corresponding path program 1 times [2018-11-06 18:20:57,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:20:57,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:20:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:57,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:20:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:20:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:20:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 18:20:57,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:20:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:20:57,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:20:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:20:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:20:57,713 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-11-06 18:20:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:20:59,852 INFO L93 Difference]: Finished difference Result 41022 states and 61357 transitions. [2018-11-06 18:20:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:20:59,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-06 18:20:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:20:59,915 INFO L225 Difference]: With dead ends: 41022 [2018-11-06 18:20:59,916 INFO L226 Difference]: Without dead ends: 29979 [2018-11-06 18:20:59,936 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 18:20:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29979 states. [2018-11-06 18:21:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29979 to 20440. [2018-11-06 18:21:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-11-06 18:21:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-11-06 18:21:00,302 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 185 [2018-11-06 18:21:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:00,303 INFO L480 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-11-06 18:21:00,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:21:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-11-06 18:21:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-06 18:21:00,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:00,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:21:00,328 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:00,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1634157547, now seen corresponding path program 1 times [2018-11-06 18:21:00,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:00,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 18:21:00,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:00,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:21:00,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:21:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:21:00,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:21:00,523 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-11-06 18:21:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:02,375 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-11-06 18:21:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:21:02,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-11-06 18:21:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:02,416 INFO L225 Difference]: With dead ends: 40906 [2018-11-06 18:21:02,416 INFO L226 Difference]: Without dead ends: 20468 [2018-11-06 18:21:02,442 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 18:21:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-11-06 18:21:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-11-06 18:21:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-11-06 18:21:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-11-06 18:21:02,895 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 186 [2018-11-06 18:21:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:02,895 INFO L480 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-11-06 18:21:02,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:21:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-11-06 18:21:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 18:21:02,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:02,919 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2018-11-06 18:21:02,919 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:02,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash -394781917, now seen corresponding path program 1 times [2018-11-06 18:21:02,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:02,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:02,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-06 18:21:03,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:03,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:21:03,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:21:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:21:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:21:03,070 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-11-06 18:21:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:05,517 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-11-06 18:21:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:21:05,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-11-06 18:21:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:05,567 INFO L225 Difference]: With dead ends: 57404 [2018-11-06 18:21:05,568 INFO L226 Difference]: Without dead ends: 36966 [2018-11-06 18:21:05,593 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 18:21:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-11-06 18:21:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-11-06 18:21:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-11-06 18:21:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-11-06 18:21:06,067 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 193 [2018-11-06 18:21:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-11-06 18:21:06,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:21:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-11-06 18:21:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 18:21:06,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:06,093 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, 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] [2018-11-06 18:21:06,094 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:06,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 576159644, now seen corresponding path program 1 times [2018-11-06 18:21:06,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:06,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:06,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 18:21:06,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:06,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:21:06,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:21:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:21:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:21:06,307 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 4 states. [2018-11-06 18:21:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:08,478 INFO L93 Difference]: Finished difference Result 87182 states and 106671 transitions. [2018-11-06 18:21:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:21:08,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 18:21:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:08,537 INFO L225 Difference]: With dead ends: 87182 [2018-11-06 18:21:08,537 INFO L226 Difference]: Without dead ends: 50226 [2018-11-06 18:21:08,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 18:21:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50226 states. [2018-11-06 18:21:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50226 to 50218. [2018-11-06 18:21:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50218 states. [2018-11-06 18:21:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50218 states to 50218 states and 59044 transitions. [2018-11-06 18:21:09,612 INFO L78 Accepts]: Start accepts. Automaton has 50218 states and 59044 transitions. Word has length 201 [2018-11-06 18:21:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:09,612 INFO L480 AbstractCegarLoop]: Abstraction has 50218 states and 59044 transitions. [2018-11-06 18:21:09,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:21:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 50218 states and 59044 transitions. [2018-11-06 18:21:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-06 18:21:09,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:09,638 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:21:09,638 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:09,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1703859263, now seen corresponding path program 1 times [2018-11-06 18:21:09,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:09,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:09,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-06 18:21:09,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:09,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:21:09,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:21:09,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:21:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:21:09,897 INFO L87 Difference]: Start difference. First operand 50218 states and 59044 transitions. Second operand 3 states. [2018-11-06 18:21:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:11,015 INFO L93 Difference]: Finished difference Result 99538 states and 116952 transitions. [2018-11-06 18:21:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:21:11,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-06 18:21:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:11,065 INFO L225 Difference]: With dead ends: 99538 [2018-11-06 18:21:11,065 INFO L226 Difference]: Without dead ends: 49322 [2018-11-06 18:21:11,100 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 18:21:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49322 states. [2018-11-06 18:21:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49322 to 49322. [2018-11-06 18:21:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49322 states. [2018-11-06 18:21:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49322 states to 49322 states and 57402 transitions. [2018-11-06 18:21:11,622 INFO L78 Accepts]: Start accepts. Automaton has 49322 states and 57402 transitions. Word has length 235 [2018-11-06 18:21:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:11,622 INFO L480 AbstractCegarLoop]: Abstraction has 49322 states and 57402 transitions. [2018-11-06 18:21:11,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:21:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 49322 states and 57402 transitions. [2018-11-06 18:21:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-06 18:21:11,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:11,635 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 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] [2018-11-06 18:21:11,635 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:11,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1273999016, now seen corresponding path program 1 times [2018-11-06 18:21:11,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:11,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:11,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:11,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 18:21:11,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:11,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:21:11,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:21:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:21:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:21:11,889 INFO L87 Difference]: Start difference. First operand 49322 states and 57402 transitions. Second operand 4 states. [2018-11-06 18:21:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:14,368 INFO L93 Difference]: Finished difference Result 162853 states and 187890 transitions. [2018-11-06 18:21:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:21:14,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-11-06 18:21:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:14,501 INFO L225 Difference]: With dead ends: 162853 [2018-11-06 18:21:14,501 INFO L226 Difference]: Without dead ends: 113533 [2018-11-06 18:21:14,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 18:21:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113533 states. [2018-11-06 18:21:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113533 to 83184. [2018-11-06 18:21:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83184 states. [2018-11-06 18:21:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83184 states to 83184 states and 95221 transitions. [2018-11-06 18:21:15,541 INFO L78 Accepts]: Start accepts. Automaton has 83184 states and 95221 transitions. Word has length 245 [2018-11-06 18:21:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:15,542 INFO L480 AbstractCegarLoop]: Abstraction has 83184 states and 95221 transitions. [2018-11-06 18:21:15,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:21:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 83184 states and 95221 transitions. [2018-11-06 18:21:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-06 18:21:15,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:15,559 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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] [2018-11-06 18:21:15,559 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:15,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash -507780283, now seen corresponding path program 1 times [2018-11-06 18:21:15,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:15,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:15,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:15,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-06 18:21:15,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:15,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:21:15,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:21:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:21:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:21:15,784 INFO L87 Difference]: Start difference. First operand 83184 states and 95221 transitions. Second operand 3 states. [2018-11-06 18:21:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:17,362 INFO L93 Difference]: Finished difference Result 166358 states and 190432 transitions. [2018-11-06 18:21:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:21:17,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-11-06 18:21:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:17,457 INFO L225 Difference]: With dead ends: 166358 [2018-11-06 18:21:17,458 INFO L226 Difference]: Without dead ends: 83176 [2018-11-06 18:21:17,505 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 18:21:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83176 states. [2018-11-06 18:21:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83176 to 83176. [2018-11-06 18:21:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83176 states. [2018-11-06 18:21:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83176 states to 83176 states and 95205 transitions. [2018-11-06 18:21:19,408 INFO L78 Accepts]: Start accepts. Automaton has 83176 states and 95205 transitions. Word has length 273 [2018-11-06 18:21:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:19,408 INFO L480 AbstractCegarLoop]: Abstraction has 83176 states and 95205 transitions. [2018-11-06 18:21:19,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:21:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 83176 states and 95205 transitions. [2018-11-06 18:21:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-06 18:21:19,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:19,429 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:21:19,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:19,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:19,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2102083729, now seen corresponding path program 1 times [2018-11-06 18:21:19,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:19,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:19,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:19,765 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 18:21:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-06 18:21:19,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 18:21:19,968 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 18:21:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:20,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 18:21:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 18:21:20,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 18:21:20,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 18:21:20,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 18:21:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 18:21:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 18:21:20,354 INFO L87 Difference]: Start difference. First operand 83176 states and 95205 transitions. Second operand 6 states. [2018-11-06 18:21:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:25,655 INFO L93 Difference]: Finished difference Result 244831 states and 280408 transitions. [2018-11-06 18:21:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 18:21:25,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2018-11-06 18:21:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:25,834 INFO L225 Difference]: With dead ends: 244831 [2018-11-06 18:21:25,834 INFO L226 Difference]: Without dead ends: 161657 [2018-11-06 18:21:25,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 18:21:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161657 states. [2018-11-06 18:21:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161657 to 160366. [2018-11-06 18:21:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160366 states. [2018-11-06 18:21:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160366 states to 160366 states and 179182 transitions. [2018-11-06 18:21:28,800 INFO L78 Accepts]: Start accepts. Automaton has 160366 states and 179182 transitions. Word has length 280 [2018-11-06 18:21:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:28,800 INFO L480 AbstractCegarLoop]: Abstraction has 160366 states and 179182 transitions. [2018-11-06 18:21:28,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 18:21:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 160366 states and 179182 transitions. [2018-11-06 18:21:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-06 18:21:28,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:28,822 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-06 18:21:28,823 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:28,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1814311929, now seen corresponding path program 1 times [2018-11-06 18:21:28,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:28,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 18:21:29,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:29,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 18:21:29,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:21:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:21:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:21:29,248 INFO L87 Difference]: Start difference. First operand 160366 states and 179182 transitions. Second operand 4 states. [2018-11-06 18:21:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:33,289 INFO L93 Difference]: Finished difference Result 604415 states and 675088 transitions. [2018-11-06 18:21:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:21:33,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-11-06 18:21:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:33,869 INFO L225 Difference]: With dead ends: 604415 [2018-11-06 18:21:33,870 INFO L226 Difference]: Without dead ends: 444051 [2018-11-06 18:21:33,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 18:21:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444051 states. [2018-11-06 18:21:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444051 to 297594. [2018-11-06 18:21:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297594 states. [2018-11-06 18:21:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297594 states to 297594 states and 332385 transitions. [2018-11-06 18:21:39,568 INFO L78 Accepts]: Start accepts. Automaton has 297594 states and 332385 transitions. Word has length 288 [2018-11-06 18:21:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:39,568 INFO L480 AbstractCegarLoop]: Abstraction has 297594 states and 332385 transitions. [2018-11-06 18:21:39,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:21:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 297594 states and 332385 transitions. [2018-11-06 18:21:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-06 18:21:39,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:39,592 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 18:21:39,592 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:39,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1462176291, now seen corresponding path program 1 times [2018-11-06 18:21:39,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:39,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:39,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:39,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 18:21:45,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:45,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 18:21:45,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:21:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:21:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:21:45,045 INFO L87 Difference]: Start difference. First operand 297594 states and 332385 transitions. Second operand 4 states. [2018-11-06 18:21:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:48,898 INFO L93 Difference]: Finished difference Result 545794 states and 611298 transitions. [2018-11-06 18:21:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:21:48,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-11-06 18:21:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:49,249 INFO L225 Difference]: With dead ends: 545794 [2018-11-06 18:21:49,250 INFO L226 Difference]: Without dead ends: 248202 [2018-11-06 18:21:49,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 18:21:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248202 states. [2018-11-06 18:21:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248202 to 243492. [2018-11-06 18:21:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243492 states. [2018-11-06 18:21:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243492 states to 243492 states and 269937 transitions. [2018-11-06 18:21:53,688 INFO L78 Accepts]: Start accepts. Automaton has 243492 states and 269937 transitions. Word has length 294 [2018-11-06 18:21:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:21:53,688 INFO L480 AbstractCegarLoop]: Abstraction has 243492 states and 269937 transitions. [2018-11-06 18:21:53,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:21:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 243492 states and 269937 transitions. [2018-11-06 18:21:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-06 18:21:53,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:21:53,716 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 18:21:53,716 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:21:53,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:21:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -72322090, now seen corresponding path program 1 times [2018-11-06 18:21:53,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:21:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:21:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:21:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:21:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:21:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-06 18:21:54,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:21:54,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:21:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:21:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:21:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:21:54,061 INFO L87 Difference]: Start difference. First operand 243492 states and 269937 transitions. Second operand 4 states. [2018-11-06 18:21:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:21:58,037 INFO L93 Difference]: Finished difference Result 507072 states and 562986 transitions. [2018-11-06 18:21:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:21:58,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2018-11-06 18:21:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:21:58,346 INFO L225 Difference]: With dead ends: 507072 [2018-11-06 18:21:58,347 INFO L226 Difference]: Without dead ends: 263582 [2018-11-06 18:21:58,465 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 18:21:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263582 states. [2018-11-06 18:22:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263582 to 260262. [2018-11-06 18:22:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260262 states. [2018-11-06 18:22:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260262 states to 260262 states and 287743 transitions. [2018-11-06 18:22:03,543 INFO L78 Accepts]: Start accepts. Automaton has 260262 states and 287743 transitions. Word has length 324 [2018-11-06 18:22:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:22:03,544 INFO L480 AbstractCegarLoop]: Abstraction has 260262 states and 287743 transitions. [2018-11-06 18:22:03,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:22:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 260262 states and 287743 transitions. [2018-11-06 18:22:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-06 18:22:03,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:22:03,576 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:03,576 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:22:03,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:22:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1893998904, now seen corresponding path program 1 times [2018-11-06 18:22:03,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:22:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:22:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:03,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:22:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:22:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-06 18:22:03,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:22:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 18:22:03,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:22:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:22:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:22:03,854 INFO L87 Difference]: Start difference. First operand 260262 states and 287743 transitions. Second operand 3 states. [2018-11-06 18:22:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:22:08,181 INFO L93 Difference]: Finished difference Result 701128 states and 772302 transitions. [2018-11-06 18:22:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:22:08,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-11-06 18:22:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:22:08,826 INFO L225 Difference]: With dead ends: 701128 [2018-11-06 18:22:08,826 INFO L226 Difference]: Without dead ends: 440868 [2018-11-06 18:22:08,988 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 18:22:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440868 states. [2018-11-06 18:22:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440868 to 439234. [2018-11-06 18:22:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439234 states. [2018-11-06 18:22:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439234 states to 439234 states and 482806 transitions. [2018-11-06 18:22:21,021 INFO L78 Accepts]: Start accepts. Automaton has 439234 states and 482806 transitions. Word has length 324 [2018-11-06 18:22:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:22:21,021 INFO L480 AbstractCegarLoop]: Abstraction has 439234 states and 482806 transitions. [2018-11-06 18:22:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:22:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 439234 states and 482806 transitions. [2018-11-06 18:22:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-06 18:22:21,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:22:21,050 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:21,050 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:22:21,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:22:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1006802306, now seen corresponding path program 1 times [2018-11-06 18:22:21,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:22:21,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:22:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:21,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:22:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:22:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 18:22:21,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:22:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:22:21,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:22:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:22:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:22:21,378 INFO L87 Difference]: Start difference. First operand 439234 states and 482806 transitions. Second operand 3 states. [2018-11-06 18:22:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:22:28,020 INFO L93 Difference]: Finished difference Result 881292 states and 968682 transitions. [2018-11-06 18:22:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:22:28,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-11-06 18:22:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:22:28,668 INFO L225 Difference]: With dead ends: 881292 [2018-11-06 18:22:28,668 INFO L226 Difference]: Without dead ends: 442060 [2018-11-06 18:22:28,845 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 18:22:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442060 states. [2018-11-06 18:22:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442060 to 442048. [2018-11-06 18:22:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442048 states. [2018-11-06 18:22:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442048 states to 442048 states and 484616 transitions. [2018-11-06 18:22:35,578 INFO L78 Accepts]: Start accepts. Automaton has 442048 states and 484616 transitions. Word has length 339 [2018-11-06 18:22:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:22:35,579 INFO L480 AbstractCegarLoop]: Abstraction has 442048 states and 484616 transitions. [2018-11-06 18:22:35,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:22:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 442048 states and 484616 transitions. [2018-11-06 18:22:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-06 18:22:35,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:22:35,614 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 18:22:35,615 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:22:35,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:22:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244667, now seen corresponding path program 1 times [2018-11-06 18:22:35,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:22:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:22:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:22:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:22:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:22:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-06 18:22:37,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:22:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:22:37,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 18:22:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 18:22:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 18:22:37,116 INFO L87 Difference]: Start difference. First operand 442048 states and 484616 transitions. Second operand 4 states. [2018-11-06 18:22:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:22:50,616 INFO L93 Difference]: Finished difference Result 1534562 states and 1680604 transitions. [2018-11-06 18:22:50,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 18:22:50,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-11-06 18:22:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:22:52,238 INFO L225 Difference]: With dead ends: 1534562 [2018-11-06 18:22:52,238 INFO L226 Difference]: Without dead ends: 1092516 [2018-11-06 18:22:52,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 18:22:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092516 states. [2018-11-06 18:23:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092516 to 676836. [2018-11-06 18:23:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676836 states. [2018-11-06 18:23:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676836 states to 676836 states and 740434 transitions. [2018-11-06 18:23:06,612 INFO L78 Accepts]: Start accepts. Automaton has 676836 states and 740434 transitions. Word has length 352 [2018-11-06 18:23:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:23:06,612 INFO L480 AbstractCegarLoop]: Abstraction has 676836 states and 740434 transitions. [2018-11-06 18:23:06,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 18:23:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 676836 states and 740434 transitions. [2018-11-06 18:23:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-06 18:23:06,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:23:06,650 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 18:23:06,650 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:23:06,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:23:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1071552378, now seen corresponding path program 1 times [2018-11-06 18:23:06,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:23:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:23:06,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:23:06,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:23:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:23:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:23:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 18:23:07,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 18:23:07,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 18:23:07,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 18:23:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 18:23:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 18:23:07,059 INFO L87 Difference]: Start difference. First operand 676836 states and 740434 transitions. Second operand 3 states. [2018-11-06 18:23:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 18:23:15,133 INFO L93 Difference]: Finished difference Result 1166968 states and 1279242 transitions. [2018-11-06 18:23:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 18:23:15,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-11-06 18:23:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 18:23:15,842 INFO L225 Difference]: With dead ends: 1166968 [2018-11-06 18:23:15,843 INFO L226 Difference]: Without dead ends: 490134 [2018-11-06 18:23:16,052 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 18:23:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490134 states. [2018-11-06 18:23:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490134 to 352036. [2018-11-06 18:23:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352036 states. [2018-11-06 18:23:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352036 states to 352036 states and 380449 transitions. [2018-11-06 18:23:31,993 INFO L78 Accepts]: Start accepts. Automaton has 352036 states and 380449 transitions. Word has length 353 [2018-11-06 18:23:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 18:23:31,994 INFO L480 AbstractCegarLoop]: Abstraction has 352036 states and 380449 transitions. [2018-11-06 18:23:31,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 18:23:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 352036 states and 380449 transitions. [2018-11-06 18:23:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-11-06 18:23:33,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 18:23:33,190 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 18:23:33,190 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 18:23:33,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 18:23:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash 954484116, now seen corresponding path program 1 times [2018-11-06 18:23:33,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 18:23:33,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 18:23:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:23:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:23:33,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 18:23:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:23:33,981 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-06 18:23:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 591 proven. 173 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-06 18:23:35,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 18:23:35,759 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-06 18:23:35,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 18:23:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 18:23:36,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 18:23:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 735 proven. 29 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-06 18:23:37,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 18:23:37,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2018-11-06 18:23:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 18:23:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 18:23:37,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-06 18:23:37,159 INFO L87 Difference]: Start difference. First operand 352036 states and 380449 transitions. Second operand 14 states. [2018-11-06 18:23:37,338 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 Received shutdown request... [2018-11-06 18:23:48,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-06 18:23:48,992 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 18:23:48,997 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 18:23:48,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:23:48 BoogieIcfgContainer [2018-11-06 18:23:48,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 18:23:48,999 INFO L168 Benchmark]: Toolchain (without parser) took 201631.30 ms. Allocated memory was 1.5 GB in the beginning and 5.9 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-06 18:23:49,000 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 18:23:49,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1212.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-06 18:23:49,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 316.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -878.1 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2018-11-06 18:23:49,002 INFO L168 Benchmark]: Boogie Preprocessor took 149.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 18:23:49,002 INFO L168 Benchmark]: RCFGBuilder took 5616.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.1 MB). Peak memory consumption was 253.1 MB. Max. memory is 7.1 GB. [2018-11-06 18:23:49,003 INFO L168 Benchmark]: TraceAbstraction took 194329.70 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-06 18:23:49,007 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1212.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 316.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -878.1 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5616.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.1 MB). Peak memory consumption was 253.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194329.70 ms. Allocated memory was 2.3 GB in the beginning and 5.9 GB in the end (delta: 3.6 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1467]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (352036states) and FLOYD_HOARE automaton (currently 35 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (83415 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.2s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 101.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6462 SDtfs, 15901 SDslu, 5897 SDs, 0 SdLazy, 24838 SolverSat, 4834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 1041 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676836occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 758752 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 6787 NumberOfCodeBlocks, 6787 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6761 ConstructedInterpolants, 0 QuantifiedInterpolants, 11431661 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1837 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 4826/5042 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown