java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:54,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:54,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:54,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:54,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:54,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:54,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:54,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:54,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:54,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:54,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:54,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:54,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:54,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:54,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:54,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:54,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:54,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:54,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:54,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:54,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:54,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:54,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:54,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:54,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:54,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:54,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:54,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:54,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:54,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:54,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:54,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:54,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:54,596 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:54,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:54,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:54,599 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:53:54,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:54,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:54,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:54,627 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:54,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:54,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:54,628 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:54,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:54,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:54,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:54,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:54,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:54,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:54,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:54,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:54,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:54,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:54,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:54,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:54,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:54,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:54,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:54,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:54,635 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:54,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:54,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:54,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:54,637 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:54,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:54,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:54,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:54,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:54,721 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:54,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-24 14:53:54,787 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5be2d9150/3a86ade2d9c94e31aef4e051b33529b2/FLAGeded8ecc5 [2018-10-24 14:53:55,501 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:55,502 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-24 14:53:55,524 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5be2d9150/3a86ade2d9c94e31aef4e051b33529b2/FLAGeded8ecc5 [2018-10-24 14:53:55,540 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5be2d9150/3a86ade2d9c94e31aef4e051b33529b2 [2018-10-24 14:53:55,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:55,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:55,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:55,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:55,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:55,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:55" (1/1) ... [2018-10-24 14:53:55,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:55, skipping insertion in model container [2018-10-24 14:53:55,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:55" (1/1) ... [2018-10-24 14:53:55,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:55,667 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:56,430 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:56,436 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:56,690 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:56,744 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:56,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56 WrapperNode [2018-10-24 14:53:56,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:56,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:56,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:56,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:56,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:56,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:57,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:57,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:57,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:57,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... [2018-10-24 14:53:57,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:57,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:57,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:57,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:57,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:53:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:57,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:54:02,309 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:54:02,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:02 BoogieIcfgContainer [2018-10-24 14:54:02,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:54:02,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:54:02,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:54:02,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:54:02,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:55" (1/3) ... [2018-10-24 14:54:02,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386629fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:02, skipping insertion in model container [2018-10-24 14:54:02,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:56" (2/3) ... [2018-10-24 14:54:02,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386629fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:02, skipping insertion in model container [2018-10-24 14:54:02,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:02" (3/3) ... [2018-10-24 14:54:02,319 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-10-24 14:54:02,330 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:54:02,340 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:54:02,358 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:54:02,397 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:54:02,397 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:54:02,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:54:02,398 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:54:02,398 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:54:02,398 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:54:02,398 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:54:02,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:54:02,399 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:54:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:54:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 14:54:02,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:02,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:02,459 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:02,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -73727940, now seen corresponding path program 1 times [2018-10-24 14:54:02,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:02,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:02,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:03,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:03,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:03,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:03,556 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:54:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:07,759 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:54:07,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:07,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-24 14:54:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:07,793 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:54:07,793 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:54:07,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:54:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:54:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:54:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:54:07,897 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 194 [2018-10-24 14:54:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:07,898 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:54:07,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:54:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:54:07,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:07,907 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:07,908 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:07,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1649660795, now seen corresponding path program 1 times [2018-10-24 14:54:07,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:07,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:07,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:07,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:08,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:08,052 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:54:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:09,790 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:54:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:09,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-10-24 14:54:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:09,800 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:54:09,800 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:54:09,804 INFO L605 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-10-24 14:54:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:54:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:54:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:54:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:54:09,848 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 203 [2018-10-24 14:54:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:09,848 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:54:09,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:54:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-24 14:54:09,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:09,854 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:09,855 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1743599183, now seen corresponding path program 1 times [2018-10-24 14:54:09,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:09,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:09,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:10,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:10,134 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:54:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:13,578 INFO L93 Difference]: Finished difference Result 3891 states and 6117 transitions. [2018-10-24 14:54:13,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:13,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-24 14:54:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:13,593 INFO L225 Difference]: With dead ends: 3891 [2018-10-24 14:54:13,593 INFO L226 Difference]: Without dead ends: 2562 [2018-10-24 14:54:13,596 INFO L605 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-10-24 14:54:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2018-10-24 14:54:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2557. [2018-10-24 14:54:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2018-10-24 14:54:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3774 transitions. [2018-10-24 14:54:13,648 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3774 transitions. Word has length 211 [2018-10-24 14:54:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:13,649 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 3774 transitions. [2018-10-24 14:54:13,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3774 transitions. [2018-10-24 14:54:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:54:13,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:13,657 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:13,657 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1812376770, now seen corresponding path program 1 times [2018-10-24 14:54:13,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:13,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:13,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:13,878 INFO L87 Difference]: Start difference. First operand 2557 states and 3774 transitions. Second operand 3 states. [2018-10-24 14:54:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:15,889 INFO L93 Difference]: Finished difference Result 6396 states and 9368 transitions. [2018-10-24 14:54:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:15,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-24 14:54:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:15,908 INFO L225 Difference]: With dead ends: 6396 [2018-10-24 14:54:15,908 INFO L226 Difference]: Without dead ends: 3841 [2018-10-24 14:54:15,912 INFO L605 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-10-24 14:54:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2018-10-24 14:54:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2018-10-24 14:54:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2018-10-24 14:54:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5572 transitions. [2018-10-24 14:54:15,989 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5572 transitions. Word has length 223 [2018-10-24 14:54:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:15,990 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5572 transitions. [2018-10-24 14:54:15,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5572 transitions. [2018-10-24 14:54:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-24 14:54:16,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:16,000 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:16,001 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:16,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1480172138, now seen corresponding path program 1 times [2018-10-24 14:54:16,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,372 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:54:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:16,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:16,551 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:54:16,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 14:54:16,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:16,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:54:16,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:16,884 INFO L87 Difference]: Start difference. First operand 3837 states and 5572 transitions. Second operand 6 states. [2018-10-24 14:54:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:24,268 INFO L93 Difference]: Finished difference Result 25612 states and 37422 transitions. [2018-10-24 14:54:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:54:24,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-10-24 14:54:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:24,363 INFO L225 Difference]: With dead ends: 25612 [2018-10-24 14:54:24,363 INFO L226 Difference]: Without dead ends: 21777 [2018-10-24 14:54:24,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:54:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21777 states. [2018-10-24 14:54:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21777 to 21749. [2018-10-24 14:54:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21749 states. [2018-10-24 14:54:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21749 states to 21749 states and 28388 transitions. [2018-10-24 14:54:24,801 INFO L78 Accepts]: Start accepts. Automaton has 21749 states and 28388 transitions. Word has length 231 [2018-10-24 14:54:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:24,801 INFO L481 AbstractCegarLoop]: Abstraction has 21749 states and 28388 transitions. [2018-10-24 14:54:24,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 21749 states and 28388 transitions. [2018-10-24 14:54:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 14:54:24,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:24,849 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:54:24,849 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:24,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1458638854, now seen corresponding path program 1 times [2018-10-24 14:54:24,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:24,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:24,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:25,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:25,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:25,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:25,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:25,075 INFO L87 Difference]: Start difference. First operand 21749 states and 28388 transitions. Second operand 3 states. [2018-10-24 14:54:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:27,433 INFO L93 Difference]: Finished difference Result 43170 states and 56423 transitions. [2018-10-24 14:54:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:27,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-10-24 14:54:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:27,488 INFO L225 Difference]: With dead ends: 43170 [2018-10-24 14:54:27,489 INFO L226 Difference]: Without dead ends: 21423 [2018-10-24 14:54:27,519 INFO L605 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-10-24 14:54:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2018-10-24 14:54:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21416. [2018-10-24 14:54:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21416 states. [2018-10-24 14:54:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21416 states to 21416 states and 26340 transitions. [2018-10-24 14:54:27,863 INFO L78 Accepts]: Start accepts. Automaton has 21416 states and 26340 transitions. Word has length 245 [2018-10-24 14:54:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:27,863 INFO L481 AbstractCegarLoop]: Abstraction has 21416 states and 26340 transitions. [2018-10-24 14:54:27,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21416 states and 26340 transitions. [2018-10-24 14:54:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-24 14:54:27,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:27,908 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:54:27,908 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:27,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1653105828, now seen corresponding path program 1 times [2018-10-24 14:54:27,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:27,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:54:28,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:28,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:28,096 INFO L87 Difference]: Start difference. First operand 21416 states and 26340 transitions. Second operand 3 states. [2018-10-24 14:54:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:30,494 INFO L93 Difference]: Finished difference Result 42750 states and 52566 transitions. [2018-10-24 14:54:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:30,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-24 14:54:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:30,535 INFO L225 Difference]: With dead ends: 42750 [2018-10-24 14:54:30,535 INFO L226 Difference]: Without dead ends: 21336 [2018-10-24 14:54:30,562 INFO L605 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-10-24 14:54:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21336 states. [2018-10-24 14:54:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21336 to 20724. [2018-10-24 14:54:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20724 states. [2018-10-24 14:54:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20724 states to 20724 states and 25148 transitions. [2018-10-24 14:54:30,992 INFO L78 Accepts]: Start accepts. Automaton has 20724 states and 25148 transitions. Word has length 261 [2018-10-24 14:54:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:30,993 INFO L481 AbstractCegarLoop]: Abstraction has 20724 states and 25148 transitions. [2018-10-24 14:54:30,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20724 states and 25148 transitions. [2018-10-24 14:54:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-24 14:54:31,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:31,025 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:54:31,026 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:31,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1354619751, now seen corresponding path program 1 times [2018-10-24 14:54:31,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:31,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:31,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:31,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:31,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:31,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:31,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:31,494 INFO L87 Difference]: Start difference. First operand 20724 states and 25148 transitions. Second operand 5 states. [2018-10-24 14:54:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:34,123 INFO L93 Difference]: Finished difference Result 69861 states and 84598 transitions. [2018-10-24 14:54:34,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:34,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-24 14:54:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:34,194 INFO L225 Difference]: With dead ends: 69861 [2018-10-24 14:54:34,194 INFO L226 Difference]: Without dead ends: 49139 [2018-10-24 14:54:34,226 INFO L605 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-10-24 14:54:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49139 states. [2018-10-24 14:54:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49139 to 47904. [2018-10-24 14:54:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2018-10-24 14:54:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 56703 transitions. [2018-10-24 14:54:34,852 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 56703 transitions. Word has length 266 [2018-10-24 14:54:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:34,853 INFO L481 AbstractCegarLoop]: Abstraction has 47904 states and 56703 transitions. [2018-10-24 14:54:34,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 56703 transitions. [2018-10-24 14:54:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 14:54:34,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:34,883 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-24 14:54:34,883 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:34,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1278485182, now seen corresponding path program 1 times [2018-10-24 14:54:34,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:34,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:35,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:35,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:35,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:35,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:35,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:35,479 INFO L87 Difference]: Start difference. First operand 47904 states and 56703 transitions. Second operand 4 states. [2018-10-24 14:54:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:37,438 INFO L93 Difference]: Finished difference Result 126994 states and 149971 transitions. [2018-10-24 14:54:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:37,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-10-24 14:54:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:37,537 INFO L225 Difference]: With dead ends: 126994 [2018-10-24 14:54:37,537 INFO L226 Difference]: Without dead ends: 79092 [2018-10-24 14:54:37,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79092 states. [2018-10-24 14:54:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79092 to 77664. [2018-10-24 14:54:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77664 states. [2018-10-24 14:54:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77664 states to 77664 states and 88158 transitions. [2018-10-24 14:54:38,408 INFO L78 Accepts]: Start accepts. Automaton has 77664 states and 88158 transitions. Word has length 285 [2018-10-24 14:54:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:38,408 INFO L481 AbstractCegarLoop]: Abstraction has 77664 states and 88158 transitions. [2018-10-24 14:54:38,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 77664 states and 88158 transitions. [2018-10-24 14:54:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-24 14:54:38,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:38,440 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:38,441 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:38,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -310432137, now seen corresponding path program 1 times [2018-10-24 14:54:38,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:38,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-24 14:54:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:38,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:38,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:38,776 INFO L87 Difference]: Start difference. First operand 77664 states and 88158 transitions. Second operand 5 states. [2018-10-24 14:54:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:41,867 INFO L93 Difference]: Finished difference Result 200561 states and 228116 transitions. [2018-10-24 14:54:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:41,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2018-10-24 14:54:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:42,029 INFO L225 Difference]: With dead ends: 200561 [2018-10-24 14:54:42,030 INFO L226 Difference]: Without dead ends: 122899 [2018-10-24 14:54:42,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122899 states. [2018-10-24 14:54:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122899 to 120193. [2018-10-24 14:54:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120193 states. [2018-10-24 14:54:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120193 states to 120193 states and 136330 transitions. [2018-10-24 14:54:43,347 INFO L78 Accepts]: Start accepts. Automaton has 120193 states and 136330 transitions. Word has length 343 [2018-10-24 14:54:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:43,347 INFO L481 AbstractCegarLoop]: Abstraction has 120193 states and 136330 transitions. [2018-10-24 14:54:43,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 120193 states and 136330 transitions. [2018-10-24 14:54:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-24 14:54:43,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:43,399 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:54:43,400 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:43,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1887185285, now seen corresponding path program 1 times [2018-10-24 14:54:43,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:43,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:44,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:44,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:44,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:44,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:44,809 INFO L87 Difference]: Start difference. First operand 120193 states and 136330 transitions. Second operand 4 states. [2018-10-24 14:54:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:47,396 INFO L93 Difference]: Finished difference Result 253863 states and 287648 transitions. [2018-10-24 14:54:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:47,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2018-10-24 14:54:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:47,544 INFO L225 Difference]: With dead ends: 253863 [2018-10-24 14:54:47,544 INFO L226 Difference]: Without dead ends: 133670 [2018-10-24 14:54:47,606 INFO L605 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-10-24 14:54:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133670 states. [2018-10-24 14:54:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133670 to 125701. [2018-10-24 14:54:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125701 states. [2018-10-24 14:54:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125701 states to 125701 states and 142381 transitions. [2018-10-24 14:54:48,799 INFO L78 Accepts]: Start accepts. Automaton has 125701 states and 142381 transitions. Word has length 346 [2018-10-24 14:54:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:48,799 INFO L481 AbstractCegarLoop]: Abstraction has 125701 states and 142381 transitions. [2018-10-24 14:54:48,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 125701 states and 142381 transitions. [2018-10-24 14:54:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-24 14:54:48,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:48,829 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:54:48,830 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:48,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash -308493581, now seen corresponding path program 1 times [2018-10-24 14:54:48,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:48,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-24 14:54:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:49,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:49,796 INFO L87 Difference]: Start difference. First operand 125701 states and 142381 transitions. Second operand 4 states. [2018-10-24 14:54:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:52,741 INFO L93 Difference]: Finished difference Result 383508 states and 430610 transitions. [2018-10-24 14:54:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:52,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-24 14:54:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:53,066 INFO L225 Difference]: With dead ends: 383508 [2018-10-24 14:54:53,067 INFO L226 Difference]: Without dead ends: 257809 [2018-10-24 14:54:53,170 INFO L605 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-10-24 14:54:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257809 states. [2018-10-24 14:54:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257809 to 199723. [2018-10-24 14:54:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199723 states. [2018-10-24 14:54:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199723 states to 199723 states and 222879 transitions. [2018-10-24 14:54:56,846 INFO L78 Accepts]: Start accepts. Automaton has 199723 states and 222879 transitions. Word has length 351 [2018-10-24 14:54:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:56,846 INFO L481 AbstractCegarLoop]: Abstraction has 199723 states and 222879 transitions. [2018-10-24 14:54:56,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 199723 states and 222879 transitions. [2018-10-24 14:54:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-24 14:54:56,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:56,894 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:54:56,894 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:56,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2131786340, now seen corresponding path program 1 times [2018-10-24 14:54:56,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:56,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:56,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:56,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:56,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:57,537 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-24 14:54:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 14:54:57,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:57,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:57,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:57,643 INFO L87 Difference]: Start difference. First operand 199723 states and 222879 transitions. Second operand 5 states. [2018-10-24 14:55:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:05,874 INFO L93 Difference]: Finished difference Result 920219 states and 1025126 transitions. [2018-10-24 14:55:05,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:55:05,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2018-10-24 14:55:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:06,860 INFO L225 Difference]: With dead ends: 920219 [2018-10-24 14:55:06,860 INFO L226 Difference]: Without dead ends: 720498 [2018-10-24 14:55:07,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:55:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720498 states. [2018-10-24 14:55:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720498 to 521142. [2018-10-24 14:55:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521142 states. [2018-10-24 14:55:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521142 states to 521142 states and 579669 transitions. [2018-10-24 14:55:23,194 INFO L78 Accepts]: Start accepts. Automaton has 521142 states and 579669 transitions. Word has length 372 [2018-10-24 14:55:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:23,194 INFO L481 AbstractCegarLoop]: Abstraction has 521142 states and 579669 transitions. [2018-10-24 14:55:23,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:55:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 521142 states and 579669 transitions. [2018-10-24 14:55:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-24 14:55:23,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:23,235 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:55:23,235 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:23,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -656143452, now seen corresponding path program 1 times [2018-10-24 14:55:23,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:23,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:23,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 14:55:23,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:23,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:23,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:23,641 INFO L87 Difference]: Start difference. First operand 521142 states and 579669 transitions. Second operand 4 states. [2018-10-24 14:55:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:30,418 INFO L93 Difference]: Finished difference Result 1051794 states and 1170526 transitions. [2018-10-24 14:55:30,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:30,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2018-10-24 14:55:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:31,302 INFO L225 Difference]: With dead ends: 1051794 [2018-10-24 14:55:31,302 INFO L226 Difference]: Without dead ends: 530654 [2018-10-24 14:55:31,603 INFO L605 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-10-24 14:55:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530654 states. [2018-10-24 14:55:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530654 to 522788. [2018-10-24 14:55:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522788 states. [2018-10-24 14:55:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522788 states to 522788 states and 580184 transitions. [2018-10-24 14:55:42,948 INFO L78 Accepts]: Start accepts. Automaton has 522788 states and 580184 transitions. Word has length 401 [2018-10-24 14:55:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:42,949 INFO L481 AbstractCegarLoop]: Abstraction has 522788 states and 580184 transitions. [2018-10-24 14:55:42,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:55:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 522788 states and 580184 transitions. [2018-10-24 14:55:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-24 14:55:43,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:43,008 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-10-24 14:55:43,008 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:43,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1619004822, now seen corresponding path program 1 times [2018-10-24 14:55:43,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:43,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:43,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 14:55:43,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:43,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:43,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:43,336 INFO L87 Difference]: Start difference. First operand 522788 states and 580184 transitions. Second operand 3 states. [2018-10-24 14:55:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:54,993 INFO L93 Difference]: Finished difference Result 1457648 states and 1614754 transitions. [2018-10-24 14:55:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:54,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 451 [2018-10-24 14:55:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:56,199 INFO L225 Difference]: With dead ends: 1457648 [2018-10-24 14:55:56,199 INFO L226 Difference]: Without dead ends: 934862 [2018-10-24 14:55:56,461 INFO L605 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-10-24 14:55:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934862 states. [2018-10-24 14:56:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934862 to 892015. [2018-10-24 14:56:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892015 states. [2018-10-24 14:56:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892015 states to 892015 states and 983556 transitions. [2018-10-24 14:56:11,657 INFO L78 Accepts]: Start accepts. Automaton has 892015 states and 983556 transitions. Word has length 451 [2018-10-24 14:56:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:11,657 INFO L481 AbstractCegarLoop]: Abstraction has 892015 states and 983556 transitions. [2018-10-24 14:56:11,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 892015 states and 983556 transitions. [2018-10-24 14:56:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-24 14:56:11,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:11,746 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:11,746 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:11,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1514659374, now seen corresponding path program 1 times [2018-10-24 14:56:11,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:11,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:11,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 337 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 14:56:14,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:56:14,320 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:56:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:14,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:56:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 256 proven. 115 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 14:56:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:56:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-24 14:56:22,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:56:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:56:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:56:22,168 INFO L87 Difference]: Start difference. First operand 892015 states and 983556 transitions. Second operand 12 states.