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_label15_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:54:03,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:54:03,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:54:03,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:54:03,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:54:03,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:54:03,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:54:03,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:54:03,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:54:03,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:54:03,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:54:03,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:54:03,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:54:03,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:54:03,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:54:03,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:54:03,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:54:03,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:54:03,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:54:03,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:54:03,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:54:03,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:54:03,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:54:03,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:54:03,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:54:03,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:54:03,780 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:54:03,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:54:03,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:54:03,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:54:03,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:54:03,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:54:03,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:54:03,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:54:03,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:54:03,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:54:03,788 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:54:03,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:54:03,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:54:03,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:54:03,815 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:54:03,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:54:03,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:54:03,816 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:54:03,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:54:03,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:54:03,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:54:03,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:54:03,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:54:03,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:54:03,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:54:03,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:54:03,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:54:03,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:54:03,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:54:03,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:54:03,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:54:03,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:54:03,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:54:03,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:54:03,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:54:03,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:54:03,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:54:03,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:54:03,822 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:54:03,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:54:03,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:54:03,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:54:03,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:54:03,912 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:54:03,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label15_true-unreach-call.c [2018-10-24 14:54:03,984 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7675cdf6d/dbc248b329064d348009a47f536fea45/FLAG1d3c8f14c [2018-10-24 14:54:04,649 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:54:04,650 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label15_true-unreach-call.c [2018-10-24 14:54:04,667 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7675cdf6d/dbc248b329064d348009a47f536fea45/FLAG1d3c8f14c [2018-10-24 14:54:04,682 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7675cdf6d/dbc248b329064d348009a47f536fea45 [2018-10-24 14:54:04,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:54:04,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:54:04,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:54:04,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:54:04,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:54:04,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:54:04" (1/1) ... [2018-10-24 14:54:04,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4dd763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:04, skipping insertion in model container [2018-10-24 14:54:04,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:54:04" (1/1) ... [2018-10-24 14:54:04,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:54:04,806 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:54:05,594 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:54:05,600 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:54:05,833 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:54:05,862 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:54:05,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05 WrapperNode [2018-10-24 14:54:05,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:54:05,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:54:05,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:54:05,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:54:05,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:05,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:54:06,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:54:06,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:54:06,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:54:06,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... [2018-10-24 14:54:06,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:54:06,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:54:06,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:54:06,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:54:06,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:54:06,373 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:54:06,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:54:06,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:54:11,949 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:54:11,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:11 BoogieIcfgContainer [2018-10-24 14:54:11,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:54:11,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:54:11,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:54:11,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:54:11,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:54:04" (1/3) ... [2018-10-24 14:54:11,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ae9bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:11, skipping insertion in model container [2018-10-24 14:54:11,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:54:05" (2/3) ... [2018-10-24 14:54:11,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ae9bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:54:11, skipping insertion in model container [2018-10-24 14:54:11,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:54:11" (3/3) ... [2018-10-24 14:54:11,960 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label15_true-unreach-call.c [2018-10-24 14:54:11,970 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:54:11,980 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:54:11,999 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:54:12,037 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:54:12,038 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:54:12,038 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:54:12,038 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:54:12,038 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:54:12,038 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:54:12,038 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:54:12,039 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:54:12,039 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:54:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:54:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 14:54:12,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:12,089 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 351494562, now seen corresponding path program 1 times [2018-10-24 14:54:12,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:13,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:13,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:13,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:13,130 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:54:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:17,456 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:54:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:17,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-24 14:54:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:17,485 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:54:17,486 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:54:17,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:54:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:54:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:54:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:54:17,578 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 201 [2018-10-24 14:54:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:17,579 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:54:17,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:54:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-24 14:54:17,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:17,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:17,587 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:17,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1470183811, now seen corresponding path program 1 times [2018-10-24 14:54:17,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:17,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:17,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:17,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:17,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:17,753 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:54:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,165 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:54:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:20,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-24 14:54:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:20,172 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:54:20,173 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:54:20,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:54:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:54:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:54:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:54:20,216 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 210 [2018-10-24 14:54:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:20,216 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:54:20,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:54:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 14:54:20,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:20,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:20,222 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:20,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1114718161, now seen corresponding path program 1 times [2018-10-24 14:54:20,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:20,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:20,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:20,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:20,523 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:54:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:25,514 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-24 14:54:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:25,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-24 14:54:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:25,526 INFO L225 Difference]: With dead ends: 2683 [2018-10-24 14:54:25,527 INFO L226 Difference]: Without dead ends: 1754 [2018-10-24 14:54:25,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-24 14:54:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-24 14:54:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-24 14:54:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-24 14:54:25,571 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 218 [2018-10-24 14:54:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:25,572 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-24 14:54:25,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-24 14:54:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:54:25,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:25,579 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:25,579 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:25,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -290151127, now seen corresponding path program 1 times [2018-10-24 14:54:25,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:25,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:25,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:25,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:25,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:25,744 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-24 14:54:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:27,233 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-24 14:54:27,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:27,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-24 14:54:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:27,250 INFO L225 Difference]: With dead ends: 5139 [2018-10-24 14:54:27,250 INFO L226 Difference]: Without dead ends: 3388 [2018-10-24 14:54:27,254 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-24 14:54:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-24 14:54:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-24 14:54:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:54:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-24 14:54:27,322 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 225 [2018-10-24 14:54:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:27,322 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-24 14:54:27,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-24 14:54:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 14:54:27,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:27,333 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:27,334 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:27,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1890312905, now seen corresponding path program 1 times [2018-10-24 14:54:27,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:27,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:27,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:27,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:27,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:27,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:27,626 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-24 14:54:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:29,986 INFO L93 Difference]: Finished difference Result 13364 states and 18287 transitions. [2018-10-24 14:54:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:29,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-10-24 14:54:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:30,029 INFO L225 Difference]: With dead ends: 13364 [2018-10-24 14:54:30,029 INFO L226 Difference]: Without dead ends: 9981 [2018-10-24 14:54:30,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2018-10-24 14:54:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 6649. [2018-10-24 14:54:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:54:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-24 14:54:30,179 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 228 [2018-10-24 14:54:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:30,180 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-24 14:54:30,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-24 14:54:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-24 14:54:30,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:30,196 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:30,196 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:30,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1887742024, now seen corresponding path program 1 times [2018-10-24 14:54:30,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:30,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:30,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:30,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:30,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:30,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:30,382 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-24 14:54:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:32,139 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-24 14:54:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:32,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-10-24 14:54:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:32,174 INFO L225 Difference]: With dead ends: 16563 [2018-10-24 14:54:32,175 INFO L226 Difference]: Without dead ends: 9916 [2018-10-24 14:54:32,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-24 14:54:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-24 14:54:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-24 14:54:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-24 14:54:32,372 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 229 [2018-10-24 14:54:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:32,373 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-24 14:54:32,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-24 14:54:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 14:54:32,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:32,395 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:32,396 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:32,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash 271299164, now seen corresponding path program 1 times [2018-10-24 14:54:32,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:32,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:32,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:32,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:32,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:32,708 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-24 14:54:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:34,600 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-24 14:54:34,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:34,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-24 14:54:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:34,632 INFO L225 Difference]: With dead ends: 24787 [2018-10-24 14:54:34,633 INFO L226 Difference]: Without dead ends: 14876 [2018-10-24 14:54:34,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-24 14:54:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-24 14:54:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-24 14:54:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-24 14:54:34,870 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 230 [2018-10-24 14:54:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:34,871 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-24 14:54:34,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-24 14:54:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-24 14:54:34,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:34,895 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:34,895 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:34,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -992007416, now seen corresponding path program 1 times [2018-10-24 14:54:34,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:35,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:35,078 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:54:35,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:35,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 14:54:35,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:35,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:54:35,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:54:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:54:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:54:35,439 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 6 states. [2018-10-24 14:54:35,656 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-10-24 14:54:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:43,868 INFO L93 Difference]: Finished difference Result 110182 states and 137504 transitions. [2018-10-24 14:54:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:54:43,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2018-10-24 14:54:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:44,105 INFO L225 Difference]: With dead ends: 110182 [2018-10-24 14:54:44,106 INFO L226 Difference]: Without dead ends: 95313 [2018-10-24 14:54:44,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:54:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95313 states. [2018-10-24 14:54:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95313 to 95244. [2018-10-24 14:54:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95244 states. [2018-10-24 14:54:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95244 states to 95244 states and 113463 transitions. [2018-10-24 14:54:45,784 INFO L78 Accepts]: Start accepts. Automaton has 95244 states and 113463 transitions. Word has length 238 [2018-10-24 14:54:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:45,784 INFO L481 AbstractCegarLoop]: Abstraction has 95244 states and 113463 transitions. [2018-10-24 14:54:45,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:54:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95244 states and 113463 transitions. [2018-10-24 14:54:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-24 14:54:45,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:45,975 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:45,976 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:45,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1667576599, now seen corresponding path program 1 times [2018-10-24 14:54:45,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-24 14:54:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:46,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:46,544 INFO L87 Difference]: Start difference. First operand 95244 states and 113463 transitions. Second operand 4 states. [2018-10-24 14:54:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:49,133 INFO L93 Difference]: Finished difference Result 190535 states and 227017 transitions. [2018-10-24 14:54:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:49,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-24 14:54:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:49,294 INFO L225 Difference]: With dead ends: 190535 [2018-10-24 14:54:49,294 INFO L226 Difference]: Without dead ends: 95293 [2018-10-24 14:54:49,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95293 states. [2018-10-24 14:54:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95293 to 95244. [2018-10-24 14:54:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95244 states. [2018-10-24 14:54:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95244 states to 95244 states and 111971 transitions. [2018-10-24 14:54:50,751 INFO L78 Accepts]: Start accepts. Automaton has 95244 states and 111971 transitions. Word has length 267 [2018-10-24 14:54:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:50,753 INFO L481 AbstractCegarLoop]: Abstraction has 95244 states and 111971 transitions. [2018-10-24 14:54:50,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95244 states and 111971 transitions. [2018-10-24 14:54:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-24 14:54:51,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:51,304 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:51,305 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:51,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 59492697, now seen corresponding path program 1 times [2018-10-24 14:54:51,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-24 14:54:51,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:51,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:51,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:51,476 INFO L87 Difference]: Start difference. First operand 95244 states and 111971 transitions. Second operand 3 states. [2018-10-24 14:54:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:53,425 INFO L93 Difference]: Finished difference Result 188952 states and 222033 transitions. [2018-10-24 14:54:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:53,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2018-10-24 14:54:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:53,531 INFO L225 Difference]: With dead ends: 188952 [2018-10-24 14:54:53,531 INFO L226 Difference]: Without dead ends: 93710 [2018-10-24 14:54:53,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93710 states. [2018-10-24 14:54:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93710 to 83870. [2018-10-24 14:54:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83870 states. [2018-10-24 14:54:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83870 states to 83870 states and 97057 transitions. [2018-10-24 14:54:54,574 INFO L78 Accepts]: Start accepts. Automaton has 83870 states and 97057 transitions. Word has length 267 [2018-10-24 14:54:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:54,574 INFO L481 AbstractCegarLoop]: Abstraction has 83870 states and 97057 transitions. [2018-10-24 14:54:54,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83870 states and 97057 transitions. [2018-10-24 14:54:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:54:54,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:54,610 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:54,611 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:54,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1936354251, now seen corresponding path program 1 times [2018-10-24 14:54:54,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:54,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:54,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:54:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:54,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:54,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:54,878 INFO L87 Difference]: Start difference. First operand 83870 states and 97057 transitions. Second operand 4 states. [2018-10-24 14:54:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:56,881 INFO L93 Difference]: Finished difference Result 165893 states and 192110 transitions. [2018-10-24 14:54:56,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:56,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-10-24 14:54:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:57,017 INFO L225 Difference]: With dead ends: 165893 [2018-10-24 14:54:57,017 INFO L226 Difference]: Without dead ends: 82025 [2018-10-24 14:54:57,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82025 states. [2018-10-24 14:54:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82025 to 82025. [2018-10-24 14:54:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82025 states. [2018-10-24 14:54:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82025 states to 82025 states and 91186 transitions. [2018-10-24 14:54:58,572 INFO L78 Accepts]: Start accepts. Automaton has 82025 states and 91186 transitions. Word has length 279 [2018-10-24 14:54:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:58,572 INFO L481 AbstractCegarLoop]: Abstraction has 82025 states and 91186 transitions. [2018-10-24 14:54:58,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82025 states and 91186 transitions. [2018-10-24 14:54:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-24 14:54:58,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:58,603 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:58,603 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:58,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 763990160, now seen corresponding path program 1 times [2018-10-24 14:54:58,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:54:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:59,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:59,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:59,008 INFO L87 Difference]: Start difference. First operand 82025 states and 91186 transitions. Second operand 5 states. [2018-10-24 14:55:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:04,582 INFO L93 Difference]: Finished difference Result 396574 states and 439228 transitions. [2018-10-24 14:55:04,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:55:04,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2018-10-24 14:55:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:05,064 INFO L225 Difference]: With dead ends: 396574 [2018-10-24 14:55:05,065 INFO L226 Difference]: Without dead ends: 314551 [2018-10-24 14:55:05,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:55:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314551 states. [2018-10-24 14:55:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314551 to 235184. [2018-10-24 14:55:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235184 states. [2018-10-24 14:55:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235184 states to 235184 states and 259632 transitions. [2018-10-24 14:55:09,549 INFO L78 Accepts]: Start accepts. Automaton has 235184 states and 259632 transitions. Word has length 281 [2018-10-24 14:55:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:09,549 INFO L481 AbstractCegarLoop]: Abstraction has 235184 states and 259632 transitions. [2018-10-24 14:55:09,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:55:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 235184 states and 259632 transitions. [2018-10-24 14:55:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-24 14:55:09,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:09,568 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:09,568 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:09,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2105506147, now seen corresponding path program 1 times [2018-10-24 14:55:09,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:09,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:09,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:09,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:10,187 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-24 14:55:10,451 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-24 14:55:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:55:10,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:10,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:55:10,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:55:10,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:55:10,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:10,514 INFO L87 Difference]: Start difference. First operand 235184 states and 259632 transitions. Second operand 6 states. [2018-10-24 14:55:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:16,411 INFO L93 Difference]: Finished difference Result 894571 states and 978664 transitions. [2018-10-24 14:55:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:55:16,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-10-24 14:55:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:17,269 INFO L225 Difference]: With dead ends: 894571 [2018-10-24 14:55:17,269 INFO L226 Difference]: Without dead ends: 659389 [2018-10-24 14:55:17,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659389 states. [2018-10-24 14:55:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659389 to 659372. [2018-10-24 14:55:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659372 states. [2018-10-24 14:55:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659372 states to 659372 states and 717988 transitions. [2018-10-24 14:55:36,042 INFO L78 Accepts]: Start accepts. Automaton has 659372 states and 717988 transitions. Word has length 282 [2018-10-24 14:55:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:36,042 INFO L481 AbstractCegarLoop]: Abstraction has 659372 states and 717988 transitions. [2018-10-24 14:55:36,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:55:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 659372 states and 717988 transitions. [2018-10-24 14:55:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-24 14:55:36,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:36,086 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:36,086 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash -988579072, now seen corresponding path program 1 times [2018-10-24 14:55:36,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:36,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:36,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:36,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-24 14:55:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:36,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:36,317 INFO L87 Difference]: Start difference. First operand 659372 states and 717988 transitions. Second operand 3 states. [2018-10-24 14:55:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:44,493 INFO L93 Difference]: Finished difference Result 1201977 states and 1308551 transitions. [2018-10-24 14:55:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:44,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-10-24 14:55:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:45,174 INFO L225 Difference]: With dead ends: 1201977 [2018-10-24 14:55:45,174 INFO L226 Difference]: Without dead ends: 542607 [2018-10-24 14:55:45,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542607 states. [2018-10-24 14:56:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542607 to 529239. [2018-10-24 14:56:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529239 states. [2018-10-24 14:56:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529239 states to 529239 states and 569335 transitions. [2018-10-24 14:56:03,337 INFO L78 Accepts]: Start accepts. Automaton has 529239 states and 569335 transitions. Word has length 314 [2018-10-24 14:56:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:03,337 INFO L481 AbstractCegarLoop]: Abstraction has 529239 states and 569335 transitions. [2018-10-24 14:56:03,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 529239 states and 569335 transitions. [2018-10-24 14:56:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-24 14:56:03,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:03,371 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:03,371 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:03,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1862321557, now seen corresponding path program 1 times [2018-10-24 14:56:03,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:03,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:03,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 14:56:03,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:56:03,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:56:03,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:04,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:56:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 48 proven. 108 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:56:04,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:56:04,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-24 14:56:04,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:56:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:56:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:56:04,339 INFO L87 Difference]: Start difference. First operand 529239 states and 569335 transitions. Second operand 9 states. [2018-10-24 14:56:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:33,915 INFO L93 Difference]: Finished difference Result 3441653 states and 3688078 transitions. [2018-10-24 14:56:33,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-24 14:56:33,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 326 [2018-10-24 14:56:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:55,997 INFO L225 Difference]: With dead ends: 3441653 [2018-10-24 14:56:55,997 INFO L226 Difference]: Without dead ends: 2912416 [2018-10-24 14:56:56,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2018-10-24 14:56:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912416 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown