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_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:00:08,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:00:08,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:00:08,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:00:08,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:00:08,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:00:08,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:00:08,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:00:08,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:00:08,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:00:08,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:00:08,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:00:08,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:00:08,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:00:08,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:00:08,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:00:08,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:00:08,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:00:08,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:00:08,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:00:08,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:00:08,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:00:08,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:00:08,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:00:08,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:00:08,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:00:08,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:00:08,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:00:08,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:00:08,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:00:08,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:00:08,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:00:08,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:00:08,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:00:08,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:00:08,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:00:08,669 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:00:08,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:00:08,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:00:08,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:00:08,700 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:00:08,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:00:08,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:00:08,701 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:00:08,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:00:08,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:00:08,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:00:08,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:00:08,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:00:08,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:00:08,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:00:08,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:00:08,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:00:08,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:00:08,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:00:08,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:00:08,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:00:08,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:00:08,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:00:08,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:00:08,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:00:08,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:00:08,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:00:08,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:00:08,708 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:00:08,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:00:08,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:00:08,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:00:08,801 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:00:08,801 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:00:08,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-26 20:00:08,875 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01dcd838b/87670a49fc4941e3b20f006900d5173d/FLAG994609821 [2018-10-26 20:00:09,614 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:00:09,616 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-26 20:00:09,634 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01dcd838b/87670a49fc4941e3b20f006900d5173d/FLAG994609821 [2018-10-26 20:00:09,649 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/01dcd838b/87670a49fc4941e3b20f006900d5173d [2018-10-26 20:00:09,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:00:09,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:00:09,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:00:09,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:00:09,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:00:09,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:00:09" (1/1) ... [2018-10-26 20:00:09,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:09, skipping insertion in model container [2018-10-26 20:00:09,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:00:09" (1/1) ... [2018-10-26 20:00:09,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:00:09,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:00:10,620 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:00:10,627 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:00:10,862 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:00:10,883 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:00:10,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10 WrapperNode [2018-10-26 20:00:10,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:00:10,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:00:10,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:00:10,886 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:00:10,895 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:00:10" (1/1) ... [2018-10-26 20:00:10,938 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:00:10" (1/1) ... [2018-10-26 20:00:11,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:00:11,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:00:11,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:00:11,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:00:11,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (1/1) ... [2018-10-26 20:00:11,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:00:11,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:00:11,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:00:11,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:00:11,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (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:00:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:00:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:00:11,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:00:17,567 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:00:17,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:00:17 BoogieIcfgContainer [2018-10-26 20:00:17,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:00:17,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:00:17,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:00:17,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:00:17,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:00:09" (1/3) ... [2018-10-26 20:00:17,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:00:17, skipping insertion in model container [2018-10-26 20:00:17,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:00:10" (2/3) ... [2018-10-26 20:00:17,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b745764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:00:17, skipping insertion in model container [2018-10-26 20:00:17,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:00:17" (3/3) ... [2018-10-26 20:00:17,578 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label16_true-unreach-call.c [2018-10-26 20:00:17,590 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:00:17,599 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:00:17,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:00:17,659 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:00:17,660 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:00:17,660 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:00:17,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:00:17,661 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:00:17,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:00:17,661 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:00:17,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:00:17,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:00:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:00:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-26 20:00:17,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:17,722 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] [2018-10-26 20:00:17,725 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:17,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1181546316, now seen corresponding path program 1 times [2018-10-26 20:00:17,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:17,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:17,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:17,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:18,580 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:00:18,698 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:00:18,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:18,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:18,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:18,731 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:00:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:22,400 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-26 20:00:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:22,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-26 20:00:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:22,433 INFO L225 Difference]: With dead ends: 1075 [2018-10-26 20:00:22,434 INFO L226 Difference]: Without dead ends: 765 [2018-10-26 20:00:22,441 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:00:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-26 20:00:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-26 20:00:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-26 20:00:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-26 20:00:22,526 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 166 [2018-10-26 20:00:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:22,528 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-26 20:00:22,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-26 20:00:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:00:22,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:22,536 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] [2018-10-26 20:00:22,536 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:22,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash 857919243, now seen corresponding path program 1 times [2018-10-26 20:00:22,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:22,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:22,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:22,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:22,696 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:00:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:00:22,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:22,700 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-26 20:00:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:25,181 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-26 20:00:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:25,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-26 20:00:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:25,188 INFO L225 Difference]: With dead ends: 1465 [2018-10-26 20:00:25,188 INFO L226 Difference]: Without dead ends: 947 [2018-10-26 20:00:25,193 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:00:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-26 20:00:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-26 20:00:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-26 20:00:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-26 20:00:25,258 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 175 [2018-10-26 20:00:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:25,258 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-26 20:00:25,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-26 20:00:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 20:00:25,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:25,272 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] [2018-10-26 20:00:25,273 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:25,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:25,273 INFO L82 PathProgramCache]: Analyzing trace with hash 954136543, now seen corresponding path program 1 times [2018-10-26 20:00:25,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:25,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:25,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:25,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:25,577 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-26 20:00:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:29,897 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-26 20:00:29,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:29,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-26 20:00:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:29,910 INFO L225 Difference]: With dead ends: 2693 [2018-10-26 20:00:29,911 INFO L226 Difference]: Without dead ends: 1764 [2018-10-26 20:00:29,913 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:00:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-26 20:00:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-26 20:00:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-26 20:00:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-26 20:00:29,957 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 183 [2018-10-26 20:00:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:29,958 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-26 20:00:29,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-26 20:00:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 20:00:29,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:29,964 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-10-26 20:00:29,964 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:29,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:29,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454467, now seen corresponding path program 1 times [2018-10-26 20:00:29,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:29,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:29,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:29,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:29,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:30,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:30,096 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-26 20:00:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:31,647 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-26 20:00:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:31,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-26 20:00:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:31,668 INFO L225 Difference]: With dead ends: 5132 [2018-10-26 20:00:31,668 INFO L226 Difference]: Without dead ends: 3386 [2018-10-26 20:00:31,672 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:00:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-26 20:00:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-26 20:00:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-26 20:00:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-26 20:00:31,802 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 190 [2018-10-26 20:00:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:31,802 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-26 20:00:31,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-26 20:00:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:00:31,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:31,810 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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] [2018-10-26 20:00:31,810 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:31,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1025659639, now seen corresponding path program 1 times [2018-10-26 20:00:31,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:31,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:31,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 20:00:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:31,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:31,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:31,961 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-26 20:00:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:33,797 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-26 20:00:33,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:33,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-26 20:00:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:33,837 INFO L225 Difference]: With dead ends: 10035 [2018-10-26 20:00:33,838 INFO L226 Difference]: Without dead ends: 6652 [2018-10-26 20:00:33,845 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:00:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-26 20:00:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-26 20:00:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-26 20:00:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-26 20:00:33,991 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 197 [2018-10-26 20:00:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:33,991 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-26 20:00:33,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-26 20:00:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:00:34,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:34,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:34,011 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:34,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2138090957, now seen corresponding path program 1 times [2018-10-26 20:00:34,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:34,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:34,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:34,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:34,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:34,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:34,375 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-26 20:00:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:36,889 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-26 20:00:36,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:36,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-26 20:00:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:36,915 INFO L225 Difference]: With dead ends: 13297 [2018-10-26 20:00:36,915 INFO L226 Difference]: Without dead ends: 6650 [2018-10-26 20:00:36,926 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:00:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-26 20:00:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-26 20:00:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-26 20:00:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-26 20:00:37,048 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 197 [2018-10-26 20:00:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:37,048 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-26 20:00:37,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-26 20:00:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-26 20:00:37,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:37,063 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:37,063 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:37,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:37,064 INFO L82 PathProgramCache]: Analyzing trace with hash 253101429, now seen corresponding path program 1 times [2018-10-26 20:00:37,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:37,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:37,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:37,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 20:00:37,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:37,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:00:37,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:37,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:37,215 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-26 20:00:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:38,127 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-26 20:00:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:38,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-26 20:00:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:38,158 INFO L225 Difference]: With dead ends: 13264 [2018-10-26 20:00:38,158 INFO L226 Difference]: Without dead ends: 6617 [2018-10-26 20:00:38,167 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:00:38,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-26 20:00:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-26 20:00:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-26 20:00:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-26 20:00:38,288 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-26 20:00:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:38,288 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-26 20:00:38,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-26 20:00:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-26 20:00:38,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:38,304 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:38,304 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:38,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1785953004, now seen corresponding path program 1 times [2018-10-26 20:00:38,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:38,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:38,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:38,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:38,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:38,495 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-26 20:00:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:39,975 INFO L93 Difference]: Finished difference Result 15882 states and 19789 transitions. [2018-10-26 20:00:39,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:39,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-26 20:00:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:39,996 INFO L225 Difference]: With dead ends: 15882 [2018-10-26 20:00:39,996 INFO L226 Difference]: Without dead ends: 9267 [2018-10-26 20:00:40,003 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:00:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9267 states. [2018-10-26 20:00:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9267 to 9267. [2018-10-26 20:00:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2018-10-26 20:00:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 10892 transitions. [2018-10-26 20:00:40,125 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 10892 transitions. Word has length 222 [2018-10-26 20:00:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:40,125 INFO L481 AbstractCegarLoop]: Abstraction has 9267 states and 10892 transitions. [2018-10-26 20:00:40,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 10892 transitions. [2018-10-26 20:00:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-26 20:00:40,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:40,141 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 20:00:40,142 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:40,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash 324309577, now seen corresponding path program 1 times [2018-10-26 20:00:40,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:40,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:40,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 20:00:40,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:40,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:40,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:40,283 INFO L87 Difference]: Start difference. First operand 9267 states and 10892 transitions. Second operand 3 states. [2018-10-26 20:00:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:41,560 INFO L93 Difference]: Finished difference Result 26494 states and 31046 transitions. [2018-10-26 20:00:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:41,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-26 20:00:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:41,596 INFO L225 Difference]: With dead ends: 26494 [2018-10-26 20:00:41,596 INFO L226 Difference]: Without dead ends: 17229 [2018-10-26 20:00:41,607 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:00:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2018-10-26 20:00:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 17225. [2018-10-26 20:00:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-26 20:00:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19750 transitions. [2018-10-26 20:00:41,819 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19750 transitions. Word has length 249 [2018-10-26 20:00:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:41,821 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19750 transitions. [2018-10-26 20:00:41,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19750 transitions. [2018-10-26 20:00:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 20:00:41,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:41,844 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:41,845 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:41,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash 585273194, now seen corresponding path program 1 times [2018-10-26 20:00:41,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:41,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:41,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:41,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 20:00:42,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:42,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:42,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:42,215 INFO L87 Difference]: Start difference. First operand 17225 states and 19750 transitions. Second operand 4 states. [2018-10-26 20:00:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:44,367 INFO L93 Difference]: Finished difference Result 34456 states and 39512 transitions. [2018-10-26 20:00:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:44,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-10-26 20:00:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:44,391 INFO L225 Difference]: With dead ends: 34456 [2018-10-26 20:00:44,392 INFO L226 Difference]: Without dead ends: 17233 [2018-10-26 20:00:44,408 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:00:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2018-10-26 20:00:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17225. [2018-10-26 20:00:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-26 20:00:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19548 transitions. [2018-10-26 20:00:44,598 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19548 transitions. Word has length 256 [2018-10-26 20:00:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:44,598 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19548 transitions. [2018-10-26 20:00:44,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19548 transitions. [2018-10-26 20:00:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 20:00:44,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:44,619 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:44,620 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:44,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash -491815230, now seen corresponding path program 1 times [2018-10-26 20:00:44,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:44,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:44,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:44,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:45,213 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 20:00:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 20:00:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:45,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:00:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:00:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:45,375 INFO L87 Difference]: Start difference. First operand 17225 states and 19548 transitions. Second operand 5 states. [2018-10-26 20:00:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:47,415 INFO L93 Difference]: Finished difference Result 52673 states and 59425 transitions. [2018-10-26 20:00:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:00:47,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-26 20:00:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:47,454 INFO L225 Difference]: With dead ends: 52673 [2018-10-26 20:00:47,454 INFO L226 Difference]: Without dead ends: 35450 [2018-10-26 20:00:47,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35450 states. [2018-10-26 20:00:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35450 to 35445. [2018-10-26 20:00:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35445 states. [2018-10-26 20:00:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35445 states to 35445 states and 39830 transitions. [2018-10-26 20:00:47,869 INFO L78 Accepts]: Start accepts. Automaton has 35445 states and 39830 transitions. Word has length 269 [2018-10-26 20:00:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:47,870 INFO L481 AbstractCegarLoop]: Abstraction has 35445 states and 39830 transitions. [2018-10-26 20:00:47,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:00:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35445 states and 39830 transitions. [2018-10-26 20:00:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-26 20:00:47,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:47,899 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:47,899 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:47,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -517916135, now seen corresponding path program 1 times [2018-10-26 20:00:47,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:48,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:48,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:48,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:48,242 INFO L87 Difference]: Start difference. First operand 35445 states and 39830 transitions. Second operand 4 states. [2018-10-26 20:00:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:50,554 INFO L93 Difference]: Finished difference Result 73150 states and 82339 transitions. [2018-10-26 20:00:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:50,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-10-26 20:00:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:50,590 INFO L225 Difference]: With dead ends: 73150 [2018-10-26 20:00:50,590 INFO L226 Difference]: Without dead ends: 37707 [2018-10-26 20:00:50,614 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:00:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37707 states. [2018-10-26 20:00:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37707 to 37695. [2018-10-26 20:00:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-26 20:00:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 42345 transitions. [2018-10-26 20:00:50,997 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 42345 transitions. Word has length 277 [2018-10-26 20:00:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:50,997 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 42345 transitions. [2018-10-26 20:00:50,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 42345 transitions. [2018-10-26 20:00:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-26 20:00:51,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:51,015 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:00:51,015 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:51,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1028863245, now seen corresponding path program 1 times [2018-10-26 20:00:51,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:51,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:51,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:51,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:51,382 INFO L87 Difference]: Start difference. First operand 37695 states and 42345 transitions. Second operand 4 states. [2018-10-26 20:00:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:52,885 INFO L93 Difference]: Finished difference Result 75399 states and 84709 transitions. [2018-10-26 20:00:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:52,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-10-26 20:00:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:52,921 INFO L225 Difference]: With dead ends: 75399 [2018-10-26 20:00:52,921 INFO L226 Difference]: Without dead ends: 37706 [2018-10-26 20:00:52,945 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:00:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37706 states. [2018-10-26 20:00:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37706 to 37695. [2018-10-26 20:00:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-26 20:00:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 41937 transitions. [2018-10-26 20:00:53,273 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 41937 transitions. Word has length 278 [2018-10-26 20:00:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:53,274 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 41937 transitions. [2018-10-26 20:00:53,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 41937 transitions. [2018-10-26 20:00:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-26 20:00:53,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:53,559 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:53,560 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:53,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -929080328, now seen corresponding path program 1 times [2018-10-26 20:00:53,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:53,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:53,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:53,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:53,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:53,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:53,802 INFO L87 Difference]: Start difference. First operand 37695 states and 41937 transitions. Second operand 3 states. [2018-10-26 20:00:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:55,620 INFO L93 Difference]: Finished difference Result 73343 states and 81685 transitions. [2018-10-26 20:00:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:55,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-10-26 20:00:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:55,661 INFO L225 Difference]: With dead ends: 73343 [2018-10-26 20:00:55,662 INFO L226 Difference]: Without dead ends: 35650 [2018-10-26 20:00:55,683 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:00:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35650 states. [2018-10-26 20:00:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35650 to 35647. [2018-10-26 20:00:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35647 states. [2018-10-26 20:00:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35647 states to 35647 states and 38821 transitions. [2018-10-26 20:00:56,005 INFO L78 Accepts]: Start accepts. Automaton has 35647 states and 38821 transitions. Word has length 294 [2018-10-26 20:00:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:56,006 INFO L481 AbstractCegarLoop]: Abstraction has 35647 states and 38821 transitions. [2018-10-26 20:00:56,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 35647 states and 38821 transitions. [2018-10-26 20:00:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-26 20:00:56,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:56,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:56,016 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:56,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 896536754, now seen corresponding path program 1 times [2018-10-26 20:00:56,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:56,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:00:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:56,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:56,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:56,385 INFO L87 Difference]: Start difference. First operand 35647 states and 38821 transitions. Second operand 4 states. [2018-10-26 20:00:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:57,346 INFO L93 Difference]: Finished difference Result 135836 states and 147858 transitions. [2018-10-26 20:00:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:57,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2018-10-26 20:00:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:57,457 INFO L225 Difference]: With dead ends: 135836 [2018-10-26 20:00:57,457 INFO L226 Difference]: Without dead ends: 100191 [2018-10-26 20:00:57,498 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:00:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100191 states. [2018-10-26 20:00:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100191 to 64134. [2018-10-26 20:00:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64134 states. [2018-10-26 20:00:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64134 states to 64134 states and 69822 transitions. [2018-10-26 20:00:58,850 INFO L78 Accepts]: Start accepts. Automaton has 64134 states and 69822 transitions. Word has length 298 [2018-10-26 20:00:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:58,851 INFO L481 AbstractCegarLoop]: Abstraction has 64134 states and 69822 transitions. [2018-10-26 20:00:58,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 64134 states and 69822 transitions. [2018-10-26 20:00:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-26 20:00:58,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:58,866 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:58,866 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:58,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:58,867 INFO L82 PathProgramCache]: Analyzing trace with hash 126833866, now seen corresponding path program 1 times [2018-10-26 20:00:58,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:58,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:58,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:58,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:58,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-26 20:00:59,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:59,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:00:59,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:59,092 INFO L87 Difference]: Start difference. First operand 64134 states and 69822 transitions. Second operand 3 states. [2018-10-26 20:01:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:00,755 INFO L93 Difference]: Finished difference Result 158805 states and 172541 transitions. [2018-10-26 20:01:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:00,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2018-10-26 20:01:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:00,848 INFO L225 Difference]: With dead ends: 158805 [2018-10-26 20:01:00,849 INFO L226 Difference]: Without dead ends: 94673 [2018-10-26 20:01:00,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94673 states. [2018-10-26 20:01:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94673 to 92616. [2018-10-26 20:01:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92616 states. [2018-10-26 20:01:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92616 states to 92616 states and 100489 transitions. [2018-10-26 20:01:01,761 INFO L78 Accepts]: Start accepts. Automaton has 92616 states and 100489 transitions. Word has length 318 [2018-10-26 20:01:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:01,761 INFO L481 AbstractCegarLoop]: Abstraction has 92616 states and 100489 transitions. [2018-10-26 20:01:01,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 92616 states and 100489 transitions. [2018-10-26 20:01:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-26 20:01:01,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:01,781 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:01:01,781 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:01,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1579485379, now seen corresponding path program 1 times [2018-10-26 20:01:01,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:01:02,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:02,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:02,941 INFO L87 Difference]: Start difference. First operand 92616 states and 100489 transitions. Second operand 4 states. [2018-10-26 20:01:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:05,309 INFO L93 Difference]: Finished difference Result 268198 states and 290902 transitions. [2018-10-26 20:01:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:05,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-10-26 20:01:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:05,517 INFO L225 Difference]: With dead ends: 268198 [2018-10-26 20:01:05,517 INFO L226 Difference]: Without dead ends: 170869 [2018-10-26 20:01:05,597 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:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170869 states. [2018-10-26 20:01:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170869 to 169432. [2018-10-26 20:01:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169432 states. [2018-10-26 20:01:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169432 states to 169432 states and 181761 transitions. [2018-10-26 20:01:08,864 INFO L78 Accepts]: Start accepts. Automaton has 169432 states and 181761 transitions. Word has length 320 [2018-10-26 20:01:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:08,864 INFO L481 AbstractCegarLoop]: Abstraction has 169432 states and 181761 transitions. [2018-10-26 20:01:08,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 169432 states and 181761 transitions. [2018-10-26 20:01:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-26 20:01:08,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:08,888 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,889 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:08,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1328338570, now seen corresponding path program 1 times [2018-10-26 20:01:08,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:09,243 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:01:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-26 20:01:09,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:09,439 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:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:09,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:01:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-26 20:01:09,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:01:09,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 20:01:09,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:01:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:01:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:01:09,929 INFO L87 Difference]: Start difference. First operand 169432 states and 181761 transitions. Second operand 6 states. [2018-10-26 20:01:10,088 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:01:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:20,102 INFO L93 Difference]: Finished difference Result 805370 states and 864039 transitions. [2018-10-26 20:01:20,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:01:20,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-10-26 20:01:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:20,975 INFO L225 Difference]: With dead ends: 805370 [2018-10-26 20:01:20,975 INFO L226 Difference]: Without dead ends: 635940 [2018-10-26 20:01:21,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:01:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635940 states. [2018-10-26 20:01:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635940 to 602296. [2018-10-26 20:01:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602296 states. [2018-10-26 20:01:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602296 states to 602296 states and 638430 transitions. [2018-10-26 20:01:36,513 INFO L78 Accepts]: Start accepts. Automaton has 602296 states and 638430 transitions. Word has length 326 [2018-10-26 20:01:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:36,514 INFO L481 AbstractCegarLoop]: Abstraction has 602296 states and 638430 transitions. [2018-10-26 20:01:36,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:01:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 602296 states and 638430 transitions. [2018-10-26 20:01:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-26 20:01:36,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:36,547 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,547 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:36,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash -777036058, now seen corresponding path program 1 times [2018-10-26 20:01:36,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:36,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 32 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 20:01:36,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:36,899 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:01:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:38,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:01:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-26 20:01:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:01:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-26 20:01:38,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:38,571 INFO L87 Difference]: Start difference. First operand 602296 states and 638430 transitions. Second operand 4 states. [2018-10-26 20:01:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:50,125 INFO L93 Difference]: Finished difference Result 2002725 states and 2120342 transitions. [2018-10-26 20:01:50,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:50,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-10-26 20:01:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:53,156 INFO L225 Difference]: With dead ends: 2002725 [2018-10-26 20:01:53,156 INFO L226 Difference]: Without dead ends: 1400431 [2018-10-26 20:01:53,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 378 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-26 20:01:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400431 states. [2018-10-26 20:02:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400431 to 922658. [2018-10-26 20:02:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922658 states. [2018-10-26 20:02:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922658 states to 922658 states and 976476 transitions. [2018-10-26 20:02:22,698 INFO L78 Accepts]: Start accepts. Automaton has 922658 states and 976476 transitions. Word has length 378 [2018-10-26 20:02:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:22,699 INFO L481 AbstractCegarLoop]: Abstraction has 922658 states and 976476 transitions. [2018-10-26 20:02:22,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 922658 states and 976476 transitions. [2018-10-26 20:02:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-26 20:02:22,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:22,783 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,783 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:22,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1084773979, now seen corresponding path program 1 times [2018-10-26 20:02:22,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:22,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:23,322 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 20:02:23,486 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:02:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:02:23,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:23,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:02:23,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:02:23,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:02:23,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:02:23,611 INFO L87 Difference]: Start difference. First operand 922658 states and 976476 transitions. Second operand 5 states. [2018-10-26 20:02:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:49,982 INFO L93 Difference]: Finished difference Result 2030370 states and 2148031 transitions. [2018-10-26 20:02:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:02:49,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2018-10-26 20:02:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:51,442 INFO L225 Difference]: With dead ends: 2030370 [2018-10-26 20:02:51,442 INFO L226 Difference]: Without dead ends: 1107714 [2018-10-26 20:02:51,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:02:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107714 states. [2018-10-26 20:03:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107714 to 965836. [2018-10-26 20:03:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965836 states. [2018-10-26 20:03:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965836 states to 965836 states and 1025224 transitions. [2018-10-26 20:03:07,778 INFO L78 Accepts]: Start accepts. Automaton has 965836 states and 1025224 transitions. Word has length 388 [2018-10-26 20:03:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:07,779 INFO L481 AbstractCegarLoop]: Abstraction has 965836 states and 1025224 transitions. [2018-10-26 20:03:07,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:03:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 965836 states and 1025224 transitions. [2018-10-26 20:03:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-26 20:03:07,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:07,858 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:07,858 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:07,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -380448547, now seen corresponding path program 1 times [2018-10-26 20:03:07,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:07,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:07,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:08,381 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:03:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-26 20:03:10,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:03:10,285 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:03:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:10,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-10-26 20:03:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:03:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-26 20:03:10,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 20:03:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 20:03:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:03:10,662 INFO L87 Difference]: Start difference. First operand 965836 states and 1025224 transitions. Second operand 10 states. Received shutdown request... [2018-10-26 20:03:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 20:03:25,541 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:03:25,546 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:03:25,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:03:25 BoogieIcfgContainer [2018-10-26 20:03:25,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:03:25,548 INFO L168 Benchmark]: Toolchain (without parser) took 195886.43 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -636.0 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-10-26 20:03:25,549 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:03:25,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1221.19 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:03:25,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:03:25,551 INFO L168 Benchmark]: Boogie Preprocessor took 133.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 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:03:25,552 INFO L168 Benchmark]: RCFGBuilder took 6231.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 267.3 MB). Peak memory consumption was 267.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:03:25,553 INFO L168 Benchmark]: TraceAbstraction took 187977.66 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 2.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-10-26 20:03:25,560 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1221.19 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 317.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 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 6231.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 267.3 MB). Peak memory consumption was 267.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187977.66 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 2.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1530]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (965836states) and FLOYD_HOARE automaton (currently 20 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (1128113 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 187.8s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 105.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5987 SDtfs, 12749 SDslu, 4740 SDs, 0 SdLazy, 24409 SolverSat, 3974 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 1167 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965836occurred in iteration=20, 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: 68.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 693171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 6751 NumberOfCodeBlocks, 6751 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 6184669 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2011 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 4273/4364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown