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_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:01:33,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:01:33,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:01:33,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:01:33,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:01:33,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:01:33,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:01:33,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:01:33,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:01:33,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:01:33,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:01:33,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:01:33,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:01:33,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:01:33,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:01:33,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:01:33,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:01:33,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:01:33,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:01:33,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:01:33,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:01:33,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:01:33,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:01:33,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:01:33,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:01:33,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:01:33,555 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:01:33,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:01:33,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:01:33,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:01:33,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:01:33,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:01:33,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:01:33,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:01:33,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:01:33,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:01:33,560 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 20:01:33,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:01:33,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:01:33,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:01:33,579 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:01:33,580 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:01:33,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:01:33,580 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:01:33,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:01:33,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:01:33,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:01:33,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:01:33,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:01:33,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:01:33,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:01:33,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:01:33,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:01:33,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:01:33,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:01:33,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:01:33,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:01:33,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:01:33,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:01:33,586 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:01:33,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:01:33,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:01:33,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:01:33,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:01:33,660 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:01:33,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-26 20:01:33,727 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8fc9d8300/14035aaefa524662b40d443800d60a20/FLAG7d8d8597c [2018-10-26 20:01:34,422 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:01:34,423 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-26 20:01:34,443 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8fc9d8300/14035aaefa524662b40d443800d60a20/FLAG7d8d8597c [2018-10-26 20:01:34,463 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8fc9d8300/14035aaefa524662b40d443800d60a20 [2018-10-26 20:01:34,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:01:34,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:01:34,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:34,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:01:34,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:01:34,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:34" (1/1) ... [2018-10-26 20:01:34,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6209f138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:34, skipping insertion in model container [2018-10-26 20:01:34,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:34" (1/1) ... [2018-10-26 20:01:34,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:01:34,607 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:01:35,358 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:35,364 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:01:35,603 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:35,629 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:01:35,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35 WrapperNode [2018-10-26 20:01:35,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:35,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:35,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:01:35,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:01:35,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:35,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:35,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:35,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:01:35,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:01:35,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:01:35,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:35,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:35,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:35,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:36,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:36,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:36,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (1/1) ... [2018-10-26 20:01:36,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:01:36,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:01:36,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:01:36,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:01:36,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (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 20:01:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:01:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:01:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:01:41,708 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:01:41,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:41 BoogieIcfgContainer [2018-10-26 20:01:41,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:01:41,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:01:41,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:01:41,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:01:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:01:34" (1/3) ... [2018-10-26 20:01:41,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d995894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:41, skipping insertion in model container [2018-10-26 20:01:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:35" (2/3) ... [2018-10-26 20:01:41,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d995894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:41, skipping insertion in model container [2018-10-26 20:01:41,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:41" (3/3) ... [2018-10-26 20:01:41,718 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label21_true-unreach-call.c [2018-10-26 20:01:41,729 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:01:41,738 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:01:41,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:01:41,800 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:01:41,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:01:41,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:01:41,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:01:41,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:01:41,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:01:41,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:01:41,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:01:41,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:01:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:01:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 20:01:41,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:41,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:41,858 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:41,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1515972374, now seen corresponding path program 1 times [2018-10-26 20:01:41,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:41,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:42,838 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 20:01:42,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:42,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:42,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:42,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:42,868 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:01:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:46,663 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 20:01:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:46,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-26 20:01:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:46,690 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 20:01:46,691 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 20:01:46,696 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 20:01:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 20:01:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 20:01:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 20:01:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 20:01:46,852 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 203 [2018-10-26 20:01:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:46,856 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 20:01:46,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 20:01:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 20:01:46,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:46,872 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:46,872 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash -197428085, now seen corresponding path program 1 times [2018-10-26 20:01:46,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:46,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:47,029 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 20:01:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:47,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:47,033 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 20:01:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:49,206 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 20:01:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:49,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-26 20:01:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:49,216 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 20:01:49,216 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 20:01:49,221 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 20:01:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 20:01:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 20:01:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 20:01:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 20:01:49,258 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 212 [2018-10-26 20:01:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:49,259 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 20:01:49,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 20:01:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-26 20:01:49,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:49,264 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:49,265 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:49,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash -472348186, now seen corresponding path program 1 times [2018-10-26 20:01:49,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:49,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:49,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:01:49,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:49,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:49,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:49,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:49,416 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 20:01:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:51,583 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-10-26 20:01:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:51,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-10-26 20:01:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:51,599 INFO L225 Difference]: With dead ends: 3977 [2018-10-26 20:01:51,599 INFO L226 Difference]: Without dead ends: 2648 [2018-10-26 20:01:51,602 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 20:01:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-26 20:01:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-10-26 20:01:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-10-26 20:01:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-10-26 20:01:51,672 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 226 [2018-10-26 20:01:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:51,673 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-10-26 20:01:51,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-10-26 20:01:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 20:01:51,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:51,682 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:51,683 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:51,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:51,683 INFO L82 PathProgramCache]: Analyzing trace with hash -494435718, now seen corresponding path program 1 times [2018-10-26 20:01:51,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 20:01:51,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:51,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:51,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:51,895 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-10-26 20:01:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:52,855 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-10-26 20:01:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:52,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-10-26 20:01:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:52,868 INFO L225 Difference]: With dead ends: 5250 [2018-10-26 20:01:52,868 INFO L226 Difference]: Without dead ends: 2607 [2018-10-26 20:01:52,872 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 20:01:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-10-26 20:01:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-10-26 20:01:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-10-26 20:01:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-10-26 20:01:52,930 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 234 [2018-10-26 20:01:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:52,930 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-10-26 20:01:52,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-10-26 20:01:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 20:01:52,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:52,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:52,938 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1318050450, now seen corresponding path program 1 times [2018-10-26 20:01:52,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:53,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:01:53,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:01:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:01:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:01:53,342 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-10-26 20:01:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:55,887 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-10-26 20:01:55,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:01:55,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2018-10-26 20:01:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:55,908 INFO L225 Difference]: With dead ends: 6279 [2018-10-26 20:01:55,908 INFO L226 Difference]: Without dead ends: 3674 [2018-10-26 20:01:55,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:01:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-10-26 20:01:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-10-26 20:01:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-10-26 20:01:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-10-26 20:01:55,979 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 243 [2018-10-26 20:01:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:55,980 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-10-26 20:01:55,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:01:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-10-26 20:01:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-26 20:01:55,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:55,988 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:55,990 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:55,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1744395106, now seen corresponding path program 1 times [2018-10-26 20:01:55,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:55,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 20:01:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:56,356 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 20:01:56,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:56,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:01:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-26 20:01:56,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:01:56,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 20:01:56,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:56,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:56,663 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-10-26 20:02:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:00,574 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-10-26 20:02:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:00,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-10-26 20:02:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:00,615 INFO L225 Difference]: With dead ends: 12048 [2018-10-26 20:02:00,616 INFO L226 Difference]: Without dead ends: 9035 [2018-10-26 20:02:00,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-10-26 20:02:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-10-26 20:02:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-10-26 20:02:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-10-26 20:02:00,769 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 279 [2018-10-26 20:02:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:00,770 INFO L481 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-10-26 20:02:00,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-10-26 20:02:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-26 20:02:00,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:00,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:00,782 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:00,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1003075031, now seen corresponding path program 1 times [2018-10-26 20:02:00,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:00,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:02:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:01,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:01,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:01,046 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-10-26 20:02:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:02,707 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-10-26 20:02:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:02,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-26 20:02:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:02,754 INFO L225 Difference]: With dead ends: 17361 [2018-10-26 20:02:02,754 INFO L226 Difference]: Without dead ends: 11341 [2018-10-26 20:02:02,764 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 20:02:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-10-26 20:02:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-10-26 20:02:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-10-26 20:02:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-10-26 20:02:02,968 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 279 [2018-10-26 20:02:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:02,969 INFO L481 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-10-26 20:02:02,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-10-26 20:02:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 20:02:02,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:02,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:02,988 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:02,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 949743912, now seen corresponding path program 1 times [2018-10-26 20:02:02,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:03,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:03,366 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-10-26 20:02:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:06,492 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-10-26 20:02:06,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:06,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-10-26 20:02:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:06,560 INFO L225 Difference]: With dead ends: 41586 [2018-10-26 20:02:06,560 INFO L226 Difference]: Without dead ends: 30251 [2018-10-26 20:02:06,579 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 20:02:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-10-26 20:02:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-10-26 20:02:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-26 20:02:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-10-26 20:02:06,912 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 282 [2018-10-26 20:02:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:06,913 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-10-26 20:02:06,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-10-26 20:02:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 20:02:06,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:06,943 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:02:06,943 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:06,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1216779258, now seen corresponding path program 1 times [2018-10-26 20:02:06,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:06,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:06,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 20:02:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:07,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:07,107 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-10-26 20:02:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:08,641 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-10-26 20:02:08,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:08,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-10-26 20:02:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:08,688 INFO L225 Difference]: With dead ends: 42264 [2018-10-26 20:02:08,688 INFO L226 Difference]: Without dead ends: 21137 [2018-10-26 20:02:08,712 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 20:02:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-10-26 20:02:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-10-26 20:02:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-26 20:02:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-10-26 20:02:08,976 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 289 [2018-10-26 20:02:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:08,976 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-10-26 20:02:08,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-10-26 20:02:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-26 20:02:09,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:09,004 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, 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 20:02:09,005 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:09,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash 287123333, now seen corresponding path program 1 times [2018-10-26 20:02:09,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:09,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-26 20:02:09,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:09,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:09,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:09,270 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-10-26 20:02:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:10,618 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-10-26 20:02:10,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:10,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-10-26 20:02:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:10,644 INFO L225 Difference]: With dead ends: 41848 [2018-10-26 20:02:10,644 INFO L226 Difference]: Without dead ends: 20721 [2018-10-26 20:02:10,663 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 20:02:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-10-26 20:02:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-10-26 20:02:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-10-26 20:02:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-10-26 20:02:10,906 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 306 [2018-10-26 20:02:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:10,906 INFO L481 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-10-26 20:02:10,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-10-26 20:02:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-26 20:02:10,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:10,924 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, 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 20:02:10,925 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:10,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1928214112, now seen corresponding path program 1 times [2018-10-26 20:02:10,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:10,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-26 20:02:11,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:11,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:11,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:11,327 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-10-26 20:02:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:14,055 INFO L93 Difference]: Finished difference Result 81406 states and 94708 transitions. [2018-10-26 20:02:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:14,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-26 20:02:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:14,116 INFO L225 Difference]: With dead ends: 81406 [2018-10-26 20:02:14,116 INFO L226 Difference]: Without dead ends: 60687 [2018-10-26 20:02:14,137 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 20:02:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60687 states. [2018-10-26 20:02:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60687 to 60685. [2018-10-26 20:02:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60685 states. [2018-10-26 20:02:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60685 states to 60685 states and 70476 transitions. [2018-10-26 20:02:14,817 INFO L78 Accepts]: Start accepts. Automaton has 60685 states and 70476 transitions. Word has length 308 [2018-10-26 20:02:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:14,817 INFO L481 AbstractCegarLoop]: Abstraction has 60685 states and 70476 transitions. [2018-10-26 20:02:14,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60685 states and 70476 transitions. [2018-10-26 20:02:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-26 20:02:14,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:14,835 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:02:14,835 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:14,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash -458556812, now seen corresponding path program 1 times [2018-10-26 20:02:14,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:14,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:14,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-26 20:02:15,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:15,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:15,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:15,009 INFO L87 Difference]: Start difference. First operand 60685 states and 70476 transitions. Second operand 3 states. [2018-10-26 20:02:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:16,845 INFO L93 Difference]: Finished difference Result 165657 states and 191383 transitions. [2018-10-26 20:02:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:16,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-26 20:02:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:16,964 INFO L225 Difference]: With dead ends: 165657 [2018-10-26 20:02:16,965 INFO L226 Difference]: Without dead ends: 104974 [2018-10-26 20:02:17,002 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 20:02:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104974 states. [2018-10-26 20:02:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104974 to 104938. [2018-10-26 20:02:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104938 states. [2018-10-26 20:02:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104938 states to 104938 states and 118157 transitions. [2018-10-26 20:02:18,053 INFO L78 Accepts]: Start accepts. Automaton has 104938 states and 118157 transitions. Word has length 341 [2018-10-26 20:02:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:18,053 INFO L481 AbstractCegarLoop]: Abstraction has 104938 states and 118157 transitions. [2018-10-26 20:02:18,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 104938 states and 118157 transitions. [2018-10-26 20:02:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 20:02:18,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:18,071 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, 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] [2018-10-26 20:02:18,071 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:18,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1480618161, now seen corresponding path program 1 times [2018-10-26 20:02:18,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:02:18,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:02:18,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:18,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:18,308 INFO L87 Difference]: Start difference. First operand 104938 states and 118157 transitions. Second operand 3 states. [2018-10-26 20:02:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:21,287 INFO L93 Difference]: Finished difference Result 263416 states and 296388 transitions. [2018-10-26 20:02:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:21,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-26 20:02:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:21,463 INFO L225 Difference]: With dead ends: 263416 [2018-10-26 20:02:21,463 INFO L226 Difference]: Without dead ends: 158480 [2018-10-26 20:02:21,528 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 20:02:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158480 states. [2018-10-26 20:02:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158480 to 158462. [2018-10-26 20:02:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158462 states. [2018-10-26 20:02:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158462 states to 158462 states and 178052 transitions. [2018-10-26 20:02:23,061 INFO L78 Accepts]: Start accepts. Automaton has 158462 states and 178052 transitions. Word has length 342 [2018-10-26 20:02:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:23,062 INFO L481 AbstractCegarLoop]: Abstraction has 158462 states and 178052 transitions. [2018-10-26 20:02:23,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 158462 states and 178052 transitions. [2018-10-26 20:02:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-26 20:02:23,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:23,801 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:23,802 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:23,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1211834363, now seen corresponding path program 1 times [2018-10-26 20:02:23,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:24,165 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:02:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:02:24,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:02:24,383 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:02:24,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:24,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:02:24,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:02:24,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 20:02:24,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:02:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:02:24,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:02:24,947 INFO L87 Difference]: Start difference. First operand 158462 states and 178052 transitions. Second operand 7 states. [2018-10-26 20:02:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:33,018 INFO L93 Difference]: Finished difference Result 490832 states and 552463 transitions. [2018-10-26 20:02:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:02:33,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2018-10-26 20:02:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:33,430 INFO L225 Difference]: With dead ends: 490832 [2018-10-26 20:02:33,430 INFO L226 Difference]: Without dead ends: 332366 [2018-10-26 20:02:33,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:02:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332366 states. [2018-10-26 20:02:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332366 to 331100. [2018-10-26 20:02:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331100 states. [2018-10-26 20:02:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331100 states to 331100 states and 362711 transitions. [2018-10-26 20:02:37,734 INFO L78 Accepts]: Start accepts. Automaton has 331100 states and 362711 transitions. Word has length 350 [2018-10-26 20:02:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:37,734 INFO L481 AbstractCegarLoop]: Abstraction has 331100 states and 362711 transitions. [2018-10-26 20:02:37,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:02:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 331100 states and 362711 transitions. [2018-10-26 20:02:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-26 20:02:37,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:37,794 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:02:37,794 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:37,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1657524425, now seen corresponding path program 1 times [2018-10-26 20:02:37,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:37,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-26 20:02:38,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:38,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:38,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:38,291 INFO L87 Difference]: Start difference. First operand 331100 states and 362711 transitions. Second operand 6 states. [2018-10-26 20:02:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:45,691 INFO L93 Difference]: Finished difference Result 1202642 states and 1309094 transitions. [2018-10-26 20:02:45,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:45,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2018-10-26 20:02:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:46,882 INFO L225 Difference]: With dead ends: 1202642 [2018-10-26 20:02:46,882 INFO L226 Difference]: Without dead ends: 871544 [2018-10-26 20:02:47,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871544 states. [2018-10-26 20:03:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871544 to 870676. [2018-10-26 20:03:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870676 states. [2018-10-26 20:03:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870676 states to 870676 states and 944357 transitions. [2018-10-26 20:03:10,725 INFO L78 Accepts]: Start accepts. Automaton has 870676 states and 944357 transitions. Word has length 414 [2018-10-26 20:03:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:10,725 INFO L481 AbstractCegarLoop]: Abstraction has 870676 states and 944357 transitions. [2018-10-26 20:03:10,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:03:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 870676 states and 944357 transitions. [2018-10-26 20:03:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-26 20:03:10,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:10,802 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:03:10,802 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:10,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1681683295, now seen corresponding path program 1 times [2018-10-26 20:03:10,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:10,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:10,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:10,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-26 20:03:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:11,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:03:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:03:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:03:11,078 INFO L87 Difference]: Start difference. First operand 870676 states and 944357 transitions. Second operand 5 states. [2018-10-26 20:03:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:34,321 INFO L93 Difference]: Finished difference Result 2249398 states and 2431434 transitions. [2018-10-26 20:03:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:03:34,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-10-26 20:03:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:36,183 INFO L225 Difference]: With dead ends: 2249398 [2018-10-26 20:03:36,184 INFO L226 Difference]: Without dead ends: 1378724 [2018-10-26 20:03:36,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:03:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378724 states. [2018-10-26 20:03:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378724 to 1269242. [2018-10-26 20:03:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269242 states. [2018-10-26 20:03:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269242 states to 1269242 states and 1370861 transitions. [2018-10-26 20:03:57,238 INFO L78 Accepts]: Start accepts. Automaton has 1269242 states and 1370861 transitions. Word has length 416 [2018-10-26 20:03:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:57,238 INFO L481 AbstractCegarLoop]: Abstraction has 1269242 states and 1370861 transitions. [2018-10-26 20:03:57,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:03:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1269242 states and 1370861 transitions. [2018-10-26 20:03:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-26 20:03:57,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:57,367 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:57,367 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:57,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 893198241, now seen corresponding path program 1 times [2018-10-26 20:03:57,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-26 20:04:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:09,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:09,310 INFO L87 Difference]: Start difference. First operand 1269242 states and 1370861 transitions. Second operand 4 states. [2018-10-26 20:04:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:26,744 INFO L93 Difference]: Finished difference Result 3659012 states and 3938065 transitions. [2018-10-26 20:04:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:26,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2018-10-26 20:04:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:29,549 INFO L225 Difference]: With dead ends: 3659012 [2018-10-26 20:04:29,550 INFO L226 Difference]: Without dead ends: 2389772 [2018-10-26 20:04:31,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389772 states. Received shutdown request... [2018-10-26 20:04:53,249 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:04:53,253 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:04:53,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:04:53 BoogieIcfgContainer [2018-10-26 20:04:53,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:04:53,254 INFO L168 Benchmark]: Toolchain (without parser) took 198778.18 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.7 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,255 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:04:53,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1150.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -892.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,257 INFO L168 Benchmark]: Boogie Preprocessor took 121.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,258 INFO L168 Benchmark]: RCFGBuilder took 5645.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,259 INFO L168 Benchmark]: TraceAbstraction took 191543.05 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 6.2 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,264 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1150.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 310.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -892.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5645.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191543.05 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 6.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1641]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1641). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 191.4s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 96.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4397 SDtfs, 12994 SDslu, 4755 SDs, 0 SdLazy, 17193 SolverSat, 3636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 646 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1269242occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 75.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 124497 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 5805 NumberOfCodeBlocks, 5805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3106999 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 3483/3497 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown