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_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:01,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:01,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:01,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:01,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:01,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:01,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:01,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:01,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:01,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:01,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:01,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:01,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:01,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:01,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:01,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:01,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:01,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:01,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:01,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:01,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:01,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:01,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:01,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:01,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:01,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:01,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:01,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:01,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:01,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:01,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:01,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:01,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:01,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:01,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:01,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:01,316 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-26 19:58:01,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:01,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:01,349 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:01,349 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:01,350 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:01,350 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:01,352 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:01,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:01,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:01,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:01,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:01,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:01,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:01,353 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:01,353 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:01,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:01,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:01,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:01,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:01,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:01,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:01,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:01,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:01,357 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:01,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:01,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:01,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:01,357 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:01,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:01,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:01,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:01,446 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:01,446 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:01,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label04_true-unreach-call.c [2018-10-26 19:58:01,526 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d08bba145/59cc66620e814ece98a6475361fa7b74/FLAGf325d3c4c [2018-10-26 19:58:02,241 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:02,242 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label04_true-unreach-call.c [2018-10-26 19:58:02,262 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d08bba145/59cc66620e814ece98a6475361fa7b74/FLAGf325d3c4c [2018-10-26 19:58:02,279 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d08bba145/59cc66620e814ece98a6475361fa7b74 [2018-10-26 19:58:02,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:02,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:02,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:02,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:02,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:02,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:02" (1/1) ... [2018-10-26 19:58:02,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697c6658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:02, skipping insertion in model container [2018-10-26 19:58:02,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:02" (1/1) ... [2018-10-26 19:58:02,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:02,395 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:03,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:03,048 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:03,336 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:03,360 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:03,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03 WrapperNode [2018-10-26 19:58:03,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:03,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:03,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:03,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:03,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:03,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:03,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:03,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:03,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (1/1) ... [2018-10-26 19:58:03,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:03,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:03,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:03,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:03,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (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-26 19:58:03,868 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:03,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:03,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:09,356 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:09,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:09 BoogieIcfgContainer [2018-10-26 19:58:09,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:09,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:09,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:09,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:09,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:02" (1/3) ... [2018-10-26 19:58:09,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce118b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:09, skipping insertion in model container [2018-10-26 19:58:09,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:03" (2/3) ... [2018-10-26 19:58:09,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce118b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:09, skipping insertion in model container [2018-10-26 19:58:09,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:09" (3/3) ... [2018-10-26 19:58:09,371 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label04_true-unreach-call.c [2018-10-26 19:58:09,379 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:09,387 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:09,404 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:09,442 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:09,443 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:09,443 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:09,443 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:09,443 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:09,443 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:09,443 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:09,444 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:09,444 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 19:58:09,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:09,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:09,493 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:09,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1635386790, now seen corresponding path program 1 times [2018-10-26 19:58:09,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:09,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:09,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:10,514 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-26 19:58:10,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:10,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:10,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:10,544 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:14,765 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-26 19:58:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:14,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-26 19:58:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:14,799 INFO L225 Difference]: With dead ends: 1075 [2018-10-26 19:58:14,799 INFO L226 Difference]: Without dead ends: 765 [2018-10-26 19:58:14,805 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-26 19:58:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-26 19:58:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-26 19:58:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-26 19:58:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-26 19:58:14,902 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 199 [2018-10-26 19:58:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:14,903 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-26 19:58:14,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-26 19:58:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 19:58:14,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:14,910 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:14,911 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:14,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 618288763, now seen corresponding path program 1 times [2018-10-26 19:58:14,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:14,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:15,059 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-26 19:58:15,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:15,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:15,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:15,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:15,062 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-26 19:58:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:17,339 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-26 19:58:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:17,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-26 19:58:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:17,346 INFO L225 Difference]: With dead ends: 1465 [2018-10-26 19:58:17,346 INFO L226 Difference]: Without dead ends: 947 [2018-10-26 19:58:17,350 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-26 19:58:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-26 19:58:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-26 19:58:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-26 19:58:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-26 19:58:17,400 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 208 [2018-10-26 19:58:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:17,401 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-26 19:58:17,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-26 19:58:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 19:58:17,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:17,412 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:17,412 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:17,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1536268327, now seen corresponding path program 1 times [2018-10-26 19:58:17,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:17,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:17,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:17,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:17,752 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-26 19:58:17,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:17,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:17,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:17,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:17,756 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-26 19:58:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:23,253 INFO L93 Difference]: Finished difference Result 2685 states and 4406 transitions. [2018-10-26 19:58:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:23,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-10-26 19:58:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:23,266 INFO L225 Difference]: With dead ends: 2685 [2018-10-26 19:58:23,266 INFO L226 Difference]: Without dead ends: 1756 [2018-10-26 19:58:23,269 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-26 19:58:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2018-10-26 19:58:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1750. [2018-10-26 19:58:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-26 19:58:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2692 transitions. [2018-10-26 19:58:23,326 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2692 transitions. Word has length 216 [2018-10-26 19:58:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:23,328 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2692 transitions. [2018-10-26 19:58:23,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2692 transitions. [2018-10-26 19:58:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 19:58:23,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:23,337 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:23,337 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:23,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 755004321, now seen corresponding path program 1 times [2018-10-26 19:58:23,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:23,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:23,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:23,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:23,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:23,531 INFO L87 Difference]: Start difference. First operand 1750 states and 2692 transitions. Second operand 3 states. [2018-10-26 19:58:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:25,392 INFO L93 Difference]: Finished difference Result 5134 states and 7944 transitions. [2018-10-26 19:58:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:25,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-10-26 19:58:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:25,411 INFO L225 Difference]: With dead ends: 5134 [2018-10-26 19:58:25,411 INFO L226 Difference]: Without dead ends: 3386 [2018-10-26 19:58:25,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-26 19:58:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3384. [2018-10-26 19:58:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-10-26 19:58:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4656 transitions. [2018-10-26 19:58:25,479 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4656 transitions. Word has length 223 [2018-10-26 19:58:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:25,479 INFO L481 AbstractCegarLoop]: Abstraction has 3384 states and 4656 transitions. [2018-10-26 19:58:25,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4656 transitions. [2018-10-26 19:58:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 19:58:25,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:25,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:25,488 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:25,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1208871158, now seen corresponding path program 1 times [2018-10-26 19:58:25,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:25,747 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:58:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:25,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:25,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:25,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:25,800 INFO L87 Difference]: Start difference. First operand 3384 states and 4656 transitions. Second operand 4 states. [2018-10-26 19:58:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:28,269 INFO L93 Difference]: Finished difference Result 13341 states and 18403 transitions. [2018-10-26 19:58:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:28,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-10-26 19:58:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:28,314 INFO L225 Difference]: With dead ends: 13341 [2018-10-26 19:58:28,314 INFO L226 Difference]: Without dead ends: 9959 [2018-10-26 19:58:28,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2018-10-26 19:58:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 6652. [2018-10-26 19:58:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-26 19:58:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 8737 transitions. [2018-10-26 19:58:28,467 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 8737 transitions. Word has length 223 [2018-10-26 19:58:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:28,468 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 8737 transitions. [2018-10-26 19:58:28,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 8737 transitions. [2018-10-26 19:58:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 19:58:28,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:28,487 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:28,487 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:28,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash -277600023, now seen corresponding path program 1 times [2018-10-26 19:58:28,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:28,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:28,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:28,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:28,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 19:58:28,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:28,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:28,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:28,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:28,704 INFO L87 Difference]: Start difference. First operand 6652 states and 8737 transitions. Second operand 3 states. [2018-10-26 19:58:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:29,477 INFO L93 Difference]: Finished difference Result 13270 states and 17429 transitions. [2018-10-26 19:58:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:29,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-26 19:58:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:29,501 INFO L225 Difference]: With dead ends: 13270 [2018-10-26 19:58:29,501 INFO L226 Difference]: Without dead ends: 6620 [2018-10-26 19:58:29,509 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-26 19:58:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-26 19:58:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-26 19:58:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-26 19:58:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8526 transitions. [2018-10-26 19:58:29,613 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8526 transitions. Word has length 237 [2018-10-26 19:58:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:29,613 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8526 transitions. [2018-10-26 19:58:29,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8526 transitions. [2018-10-26 19:58:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-26 19:58:29,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:29,630 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:29,631 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:29,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1510596309, now seen corresponding path program 1 times [2018-10-26 19:58:29,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:29,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:29,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:29,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:29,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:29,958 INFO L87 Difference]: Start difference. First operand 6620 states and 8526 transitions. Second operand 4 states. [2018-10-26 19:58:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:31,978 INFO L93 Difference]: Finished difference Result 16097 states and 21165 transitions. [2018-10-26 19:58:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:31,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-10-26 19:58:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:32,019 INFO L225 Difference]: With dead ends: 16097 [2018-10-26 19:58:32,019 INFO L226 Difference]: Without dead ends: 9479 [2018-10-26 19:58:32,027 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-26 19:58:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2018-10-26 19:58:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 9476. [2018-10-26 19:58:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-10-26 19:58:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11634 transitions. [2018-10-26 19:58:32,158 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11634 transitions. Word has length 264 [2018-10-26 19:58:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:32,159 INFO L481 AbstractCegarLoop]: Abstraction has 9476 states and 11634 transitions. [2018-10-26 19:58:32,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11634 transitions. [2018-10-26 19:58:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-26 19:58:32,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:32,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:32,178 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:32,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash 432220372, now seen corresponding path program 1 times [2018-10-26 19:58:32,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:32,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:32,567 INFO L87 Difference]: Start difference. First operand 9476 states and 11634 transitions. Second operand 4 states. [2018-10-26 19:58:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,540 INFO L93 Difference]: Finished difference Result 34296 states and 41507 transitions. [2018-10-26 19:58:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:34,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-10-26 19:58:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,586 INFO L225 Difference]: With dead ends: 34296 [2018-10-26 19:58:34,587 INFO L226 Difference]: Without dead ends: 24822 [2018-10-26 19:58:34,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24822 states. [2018-10-26 19:58:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24822 to 17840. [2018-10-26 19:58:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17840 states. [2018-10-26 19:58:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 21339 transitions. [2018-10-26 19:58:34,856 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 21339 transitions. Word has length 275 [2018-10-26 19:58:34,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:34,857 INFO L481 AbstractCegarLoop]: Abstraction has 17840 states and 21339 transitions. [2018-10-26 19:58:34,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 21339 transitions. [2018-10-26 19:58:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-26 19:58:34,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58: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, 1, 1, 1, 1, 1] [2018-10-26 19:58:34,883 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:34,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1169171758, now seen corresponding path program 1 times [2018-10-26 19:58:34,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:35,095 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-26 19:58:35,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:35,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:35,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:35,098 INFO L87 Difference]: Start difference. First operand 17840 states and 21339 transitions. Second operand 3 states. [2018-10-26 19:58:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:36,900 INFO L93 Difference]: Finished difference Result 35679 states and 42678 transitions. [2018-10-26 19:58:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:36,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2018-10-26 19:58:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:36,926 INFO L225 Difference]: With dead ends: 35679 [2018-10-26 19:58:36,926 INFO L226 Difference]: Without dead ends: 17841 [2018-10-26 19:58:36,942 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-26 19:58:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17841 states. [2018-10-26 19:58:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17841 to 17840. [2018-10-26 19:58:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17840 states. [2018-10-26 19:58:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 20556 transitions. [2018-10-26 19:58:37,161 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 20556 transitions. Word has length 290 [2018-10-26 19:58:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:37,161 INFO L481 AbstractCegarLoop]: Abstraction has 17840 states and 20556 transitions. [2018-10-26 19:58:37,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 20556 transitions. [2018-10-26 19:58:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-26 19:58:37,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:37,187 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:37,188 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:37,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1581482495, now seen corresponding path program 1 times [2018-10-26 19:58:37,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:37,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-26 19:58:37,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:37,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:37,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:58:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:58:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:37,489 INFO L87 Difference]: Start difference. First operand 17840 states and 20556 transitions. Second operand 5 states. [2018-10-26 19:58:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,598 INFO L93 Difference]: Finished difference Result 54724 states and 62701 transitions. [2018-10-26 19:58:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:58:39,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-10-26 19:58:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,631 INFO L225 Difference]: With dead ends: 54724 [2018-10-26 19:58:39,631 INFO L226 Difference]: Without dead ends: 36886 [2018-10-26 19:58:39,649 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-26 19:58:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36886 states. [2018-10-26 19:58:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36886 to 36881. [2018-10-26 19:58:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36881 states. [2018-10-26 19:58:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36881 states to 36881 states and 42094 transitions. [2018-10-26 19:58:40,098 INFO L78 Accepts]: Start accepts. Automaton has 36881 states and 42094 transitions. Word has length 300 [2018-10-26 19:58:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:40,099 INFO L481 AbstractCegarLoop]: Abstraction has 36881 states and 42094 transitions. [2018-10-26 19:58:40,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:58:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36881 states and 42094 transitions. [2018-10-26 19:58:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-26 19:58:40,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:40,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:40,126 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:40,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -188463746, now seen corresponding path program 1 times [2018-10-26 19:58:40,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 19:58:40,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:40,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:40,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:40,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:40,726 INFO L87 Difference]: Start difference. First operand 36881 states and 42094 transitions. Second operand 4 states. [2018-10-26 19:58:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:42,384 INFO L93 Difference]: Finished difference Result 72530 states and 82825 transitions. [2018-10-26 19:58:42,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:42,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2018-10-26 19:58:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:42,417 INFO L225 Difference]: With dead ends: 72530 [2018-10-26 19:58:42,418 INFO L226 Difference]: Without dead ends: 35651 [2018-10-26 19:58:42,437 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-26 19:58:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35651 states. [2018-10-26 19:58:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35651 to 35651. [2018-10-26 19:58:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35651 states. [2018-10-26 19:58:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35651 states to 35651 states and 39211 transitions. [2018-10-26 19:58:42,866 INFO L78 Accepts]: Start accepts. Automaton has 35651 states and 39211 transitions. Word has length 301 [2018-10-26 19:58:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:42,867 INFO L481 AbstractCegarLoop]: Abstraction has 35651 states and 39211 transitions. [2018-10-26 19:58:42,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35651 states and 39211 transitions. [2018-10-26 19:58:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 19:58:42,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:42,883 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:42,884 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:42,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:42,884 INFO L82 PathProgramCache]: Analyzing trace with hash -625600061, now seen corresponding path program 1 times [2018-10-26 19:58:42,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:42,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:42,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:42,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:42,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-26 19:58:43,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:43,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:43,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:43,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:43,231 INFO L87 Difference]: Start difference. First operand 35651 states and 39211 transitions. Second operand 4 states. [2018-10-26 19:58:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:45,603 INFO L93 Difference]: Finished difference Result 130528 states and 142960 transitions. [2018-10-26 19:58:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:45,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-10-26 19:58:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:46,014 INFO L225 Difference]: With dead ends: 130528 [2018-10-26 19:58:46,014 INFO L226 Difference]: Without dead ends: 94879 [2018-10-26 19:58:46,036 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-26 19:58:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94879 states. [2018-10-26 19:58:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94879 to 94875. [2018-10-26 19:58:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94875 states. [2018-10-26 19:58:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94875 states to 94875 states and 103608 transitions. [2018-10-26 19:58:46,935 INFO L78 Accepts]: Start accepts. Automaton has 94875 states and 103608 transitions. Word has length 303 [2018-10-26 19:58:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:46,936 INFO L481 AbstractCegarLoop]: Abstraction has 94875 states and 103608 transitions. [2018-10-26 19:58:46,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 94875 states and 103608 transitions. [2018-10-26 19:58:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-26 19:58:46,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:46,952 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:46,952 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:46,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash 89891661, now seen corresponding path program 1 times [2018-10-26 19:58:46,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 19:58:47,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:47,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:47,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:47,177 INFO L87 Difference]: Start difference. First operand 94875 states and 103608 transitions. Second operand 3 states. [2018-10-26 19:58:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:48,618 INFO L93 Difference]: Finished difference Result 189745 states and 207211 transitions. [2018-10-26 19:58:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:48,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-10-26 19:58:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:48,711 INFO L225 Difference]: With dead ends: 189745 [2018-10-26 19:58:48,711 INFO L226 Difference]: Without dead ends: 94872 [2018-10-26 19:58:48,758 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-26 19:58:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94872 states. [2018-10-26 19:58:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94872 to 94872. [2018-10-26 19:58:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94872 states. [2018-10-26 19:58:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94872 states to 94872 states and 103602 transitions. [2018-10-26 19:58:50,501 INFO L78 Accepts]: Start accepts. Automaton has 94872 states and 103602 transitions. Word has length 332 [2018-10-26 19:58:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:50,501 INFO L481 AbstractCegarLoop]: Abstraction has 94872 states and 103602 transitions. [2018-10-26 19:58:50,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 94872 states and 103602 transitions. [2018-10-26 19:58:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 19:58:50,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:50,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:50,519 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash 608085876, now seen corresponding path program 1 times [2018-10-26 19:58:50,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 19:58:50,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:50,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:50,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:50,676 INFO L87 Difference]: Start difference. First operand 94872 states and 103602 transitions. Second operand 3 states. [2018-10-26 19:58:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:52,326 INFO L93 Difference]: Finished difference Result 236472 states and 257846 transitions. [2018-10-26 19:58:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:52,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2018-10-26 19:58:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:52,469 INFO L225 Difference]: With dead ends: 236472 [2018-10-26 19:58:52,469 INFO L226 Difference]: Without dead ends: 141602 [2018-10-26 19:58:52,514 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-26 19:58:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141602 states. [2018-10-26 19:58:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141602 to 138311. [2018-10-26 19:58:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138311 states. [2018-10-26 19:58:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138311 states to 138311 states and 150689 transitions. [2018-10-26 19:58:54,791 INFO L78 Accepts]: Start accepts. Automaton has 138311 states and 150689 transitions. Word has length 337 [2018-10-26 19:58:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:54,791 INFO L481 AbstractCegarLoop]: Abstraction has 138311 states and 150689 transitions. [2018-10-26 19:58:54,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 138311 states and 150689 transitions. [2018-10-26 19:58:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-26 19:58:54,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:54,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:54,813 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:54,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash -645539913, now seen corresponding path program 1 times [2018-10-26 19:58:54,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:54,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:55,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:55,186 INFO L87 Difference]: Start difference. First operand 138311 states and 150689 transitions. Second operand 3 states. [2018-10-26 19:58:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:57,089 INFO L93 Difference]: Finished difference Result 264166 states and 288289 transitions. [2018-10-26 19:58:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:57,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-10-26 19:58:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:57,277 INFO L225 Difference]: With dead ends: 264166 [2018-10-26 19:58:57,278 INFO L226 Difference]: Without dead ends: 125857 [2018-10-26 19:58:57,360 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-26 19:58:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125857 states. [2018-10-26 19:59:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125857 to 125399. [2018-10-26 19:59:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125399 states. [2018-10-26 19:59:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125399 states to 125399 states and 135766 transitions. [2018-10-26 19:59:00,875 INFO L78 Accepts]: Start accepts. Automaton has 125399 states and 135766 transitions. Word has length 339 [2018-10-26 19:59:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:00,876 INFO L481 AbstractCegarLoop]: Abstraction has 125399 states and 135766 transitions. [2018-10-26 19:59:00,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 125399 states and 135766 transitions. [2018-10-26 19:59:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-26 19:59:00,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:00,921 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 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] [2018-10-26 19:59:00,921 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:00,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1762118887, now seen corresponding path program 1 times [2018-10-26 19:59:00,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:00,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-26 19:59:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:01,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:01,364 INFO L87 Difference]: Start difference. First operand 125399 states and 135766 transitions. Second operand 4 states. [2018-10-26 19:59:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:04,869 INFO L93 Difference]: Finished difference Result 254299 states and 275345 transitions. [2018-10-26 19:59:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:04,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-10-26 19:59:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:05,016 INFO L225 Difference]: With dead ends: 254299 [2018-10-26 19:59:05,016 INFO L226 Difference]: Without dead ends: 128902 [2018-10-26 19:59:05,093 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-26 19:59:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128902 states. [2018-10-26 19:59:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128902 to 127233. [2018-10-26 19:59:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127233 states. [2018-10-26 19:59:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127233 states to 127233 states and 137494 transitions. [2018-10-26 19:59:11,882 INFO L78 Accepts]: Start accepts. Automaton has 127233 states and 137494 transitions. Word has length 386 [2018-10-26 19:59:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:11,882 INFO L481 AbstractCegarLoop]: Abstraction has 127233 states and 137494 transitions. [2018-10-26 19:59:11,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 127233 states and 137494 transitions. [2018-10-26 19:59:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-26 19:59:11,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:11,935 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:11,935 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:11,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:11,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1892515548, now seen corresponding path program 1 times [2018-10-26 19:59:11,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 156 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 19:59:12,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:12,264 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-26 19:59:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:12,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:59:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-10-26 19:59:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:59:12,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 19:59:12,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:59:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:59:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:59:12,666 INFO L87 Difference]: Start difference. First operand 127233 states and 137494 transitions. Second operand 6 states. [2018-10-26 19:59:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:20,641 INFO L93 Difference]: Finished difference Result 629405 states and 681734 transitions. [2018-10-26 19:59:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:59:20,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 435 [2018-10-26 19:59:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:21,200 INFO L225 Difference]: With dead ends: 629405 [2018-10-26 19:59:21,200 INFO L226 Difference]: Without dead ends: 502174 [2018-10-26 19:59:21,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:59:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502174 states. [2018-10-26 19:59:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502174 to 490247. [2018-10-26 19:59:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490247 states. [2018-10-26 19:59:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490247 states to 490247 states and 522609 transitions. [2018-10-26 19:59:28,518 INFO L78 Accepts]: Start accepts. Automaton has 490247 states and 522609 transitions. Word has length 435 [2018-10-26 19:59:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:28,518 INFO L481 AbstractCegarLoop]: Abstraction has 490247 states and 522609 transitions. [2018-10-26 19:59:28,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:59:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 490247 states and 522609 transitions. [2018-10-26 19:59:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-26 19:59:28,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:28,561 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-26 19:59:28,562 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:28,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash 551573779, now seen corresponding path program 1 times [2018-10-26 19:59:28,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:28,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 19:59:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:30,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:30,294 INFO L87 Difference]: Start difference. First operand 490247 states and 522609 transitions. Second operand 3 states. [2018-10-26 19:59:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:35,927 INFO L93 Difference]: Finished difference Result 1266719 states and 1349191 transitions. [2018-10-26 19:59:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:35,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-10-26 19:59:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:36,913 INFO L225 Difference]: With dead ends: 1266719 [2018-10-26 19:59:36,913 INFO L226 Difference]: Without dead ends: 776474 [2018-10-26 19:59:37,173 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-26 19:59:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776474 states. [2018-10-26 19:59:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776474 to 729108. [2018-10-26 19:59:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729108 states. [2018-10-26 19:59:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729108 states to 729108 states and 775133 transitions. [2018-10-26 19:59:58,738 INFO L78 Accepts]: Start accepts. Automaton has 729108 states and 775133 transitions. Word has length 436 [2018-10-26 19:59:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:58,738 INFO L481 AbstractCegarLoop]: Abstraction has 729108 states and 775133 transitions. [2018-10-26 19:59:58,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 729108 states and 775133 transitions. [2018-10-26 19:59:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-26 19:59:58,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:58,801 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:58,801 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:58,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1478566449, now seen corresponding path program 1 times [2018-10-26 19:59:58,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:58,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 270 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:59,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:59,965 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-26 20:00:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:01,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-26 20:00:01,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:00:01,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 20:00:01,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:00:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:00:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:00:01,578 INFO L87 Difference]: Start difference. First operand 729108 states and 775133 transitions. Second operand 11 states. [2018-10-26 20:00:10,115 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 20:00:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:31,911 INFO L93 Difference]: Finished difference Result 2908895 states and 3096403 transitions. [2018-10-26 20:00:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:00:31,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 438 [2018-10-26 20:00:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:53,195 INFO L225 Difference]: With dead ends: 2908895 [2018-10-26 20:00:53,196 INFO L226 Difference]: Without dead ends: 2179777 [2018-10-26 20:00:53,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:00:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179777 states. Received shutdown request...