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/Problem11_label48_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:12:02,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:12:02,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:12:02,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:12:02,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:12:02,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:12:02,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:12:02,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:12:02,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:12:02,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:12:02,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:12:02,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:12:02,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:12:02,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:12:02,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:12:02,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:12:02,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:12:02,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:12:02,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:12:02,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:12:02,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:12:02,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:12:02,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:12:02,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:12:02,711 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:12:02,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:12:02,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:12:02,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:12:02,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:12:02,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:12:02,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:12:02,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:12:02,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:12:02,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:12:02,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:12:02,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:12:02,719 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 21:12:02,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:12:02,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:12:02,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:12:02,735 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:12:02,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:12:02,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:12:02,737 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:12:02,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:12:02,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:12:02,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:12:02,737 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:12:02,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:12:02,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:12:02,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:12:02,738 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:12:02,738 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:12:02,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:12:02,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:12:02,739 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:12:02,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:12:02,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:12:02,739 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:12:02,740 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:12:02,740 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:12:02,740 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:12:02,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:12:02,740 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:12:02,741 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:12:02,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:12:02,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:12:02,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:12:02,823 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:12:02,823 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:12:02,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label48_true-unreach-call.c [2018-10-26 21:12:02,882 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/873d88b0e/b8af7f1fe22a4ae4b0d7920b232526f5/FLAG17f676926 [2018-10-26 21:12:03,447 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:12:03,448 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label48_true-unreach-call.c [2018-10-26 21:12:03,479 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/873d88b0e/b8af7f1fe22a4ae4b0d7920b232526f5/FLAG17f676926 [2018-10-26 21:12:03,504 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/873d88b0e/b8af7f1fe22a4ae4b0d7920b232526f5 [2018-10-26 21:12:03,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:12:03,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:12:03,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:12:03,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:12:03,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:12:03,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:12:03" (1/1) ... [2018-10-26 21:12:03,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9642eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:03, skipping insertion in model container [2018-10-26 21:12:03,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:12:03" (1/1) ... [2018-10-26 21:12:03,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:12:03,624 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:12:04,289 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:12:04,298 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:12:04,481 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:12:04,500 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:12:04,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04 WrapperNode [2018-10-26 21:12:04,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:12:04,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:12:04,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:12:04,506 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:12:04,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:12:04,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:12:04,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:12:04,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:12:04,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (1/1) ... [2018-10-26 21:12:04,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:12:04,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:12:04,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:12:04,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:12:04,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (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 21:12:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:12:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:12:05,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:12:09,931 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:12:09,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:12:09 BoogieIcfgContainer [2018-10-26 21:12:09,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:12:09,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:12:09,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:12:09,938 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:12:09,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:12:03" (1/3) ... [2018-10-26 21:12:09,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b85053c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:12:09, skipping insertion in model container [2018-10-26 21:12:09,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:12:04" (2/3) ... [2018-10-26 21:12:09,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b85053c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:12:09, skipping insertion in model container [2018-10-26 21:12:09,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:12:09" (3/3) ... [2018-10-26 21:12:09,942 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label48_true-unreach-call.c [2018-10-26 21:12:09,952 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:12:09,961 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:12:09,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:12:10,020 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:12:10,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:12:10,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:12:10,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:12:10,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:12:10,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:12:10,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:12:10,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:12:10,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:12:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-26 21:12:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 21:12:10,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:10,077 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] [2018-10-26 21:12:10,079 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:10,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1316472986, now seen corresponding path program 1 times [2018-10-26 21:12:10,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:10,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:10,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:10,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:10,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:10,635 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 21:12:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:12:10,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:10,667 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-26 21:12:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:13,718 INFO L93 Difference]: Finished difference Result 955 states and 1722 transitions. [2018-10-26 21:12:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:12:13,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-26 21:12:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:13,748 INFO L225 Difference]: With dead ends: 955 [2018-10-26 21:12:13,748 INFO L226 Difference]: Without dead ends: 664 [2018-10-26 21:12:13,754 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 21:12:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-26 21:12:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2018-10-26 21:12:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-26 21:12:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 716 transitions. [2018-10-26 21:12:13,839 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 716 transitions. Word has length 51 [2018-10-26 21:12:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:13,840 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 716 transitions. [2018-10-26 21:12:13,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2018-10-26 21:12:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 21:12:13,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:13,850 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 21:12:13,850 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:13,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash 301697122, now seen corresponding path program 1 times [2018-10-26 21:12:13,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:13,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:13,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:13,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:12:14,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:14,137 INFO L87 Difference]: Start difference. First operand 472 states and 716 transitions. Second operand 4 states. [2018-10-26 21:12:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:17,606 INFO L93 Difference]: Finished difference Result 1700 states and 2661 transitions. [2018-10-26 21:12:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:12:17,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-10-26 21:12:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:17,615 INFO L225 Difference]: With dead ends: 1700 [2018-10-26 21:12:17,616 INFO L226 Difference]: Without dead ends: 1230 [2018-10-26 21:12:17,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-26 21:12:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1216. [2018-10-26 21:12:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-10-26 21:12:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1756 transitions. [2018-10-26 21:12:17,687 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1756 transitions. Word has length 120 [2018-10-26 21:12:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:17,688 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1756 transitions. [2018-10-26 21:12:17,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1756 transitions. [2018-10-26 21:12:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 21:12:17,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:17,697 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:12:17,697 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:17,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash -332525066, now seen corresponding path program 1 times [2018-10-26 21:12:17,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:17,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:17,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:17,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:17,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:12:17,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:17,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:17,988 INFO L87 Difference]: Start difference. First operand 1216 states and 1756 transitions. Second operand 4 states. [2018-10-26 21:12:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:22,088 INFO L93 Difference]: Finished difference Result 4493 states and 6609 transitions. [2018-10-26 21:12:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:12:22,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-26 21:12:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:22,105 INFO L225 Difference]: With dead ends: 4493 [2018-10-26 21:12:22,105 INFO L226 Difference]: Without dead ends: 3279 [2018-10-26 21:12:22,108 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 21:12:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-10-26 21:12:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2327. [2018-10-26 21:12:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-10-26 21:12:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3050 transitions. [2018-10-26 21:12:22,160 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3050 transitions. Word has length 128 [2018-10-26 21:12:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:22,160 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 3050 transitions. [2018-10-26 21:12:22,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3050 transitions. [2018-10-26 21:12:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-26 21:12:22,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:22,167 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:22,168 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:22,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash 650117298, now seen corresponding path program 1 times [2018-10-26 21:12:22,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:22,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:22,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:22,768 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-26 21:12:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:22,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:22,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:12:22,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:22,810 INFO L87 Difference]: Start difference. First operand 2327 states and 3050 transitions. Second operand 4 states. [2018-10-26 21:12:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:27,510 INFO L93 Difference]: Finished difference Result 5964 states and 7957 transitions. [2018-10-26 21:12:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:12:27,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-10-26 21:12:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:27,532 INFO L225 Difference]: With dead ends: 5964 [2018-10-26 21:12:27,532 INFO L226 Difference]: Without dead ends: 3824 [2018-10-26 21:12:27,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2018-10-26 21:12:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3622. [2018-10-26 21:12:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-10-26 21:12:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4613 transitions. [2018-10-26 21:12:27,618 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4613 transitions. Word has length 241 [2018-10-26 21:12:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:27,620 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 4613 transitions. [2018-10-26 21:12:27,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4613 transitions. [2018-10-26 21:12:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-26 21:12:27,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:27,629 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:27,629 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:27,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1057452654, now seen corresponding path program 1 times [2018-10-26 21:12:27,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:27,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:27,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:27,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 21:12:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:12:27,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:12:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:12:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:12:27,962 INFO L87 Difference]: Start difference. First operand 3622 states and 4613 transitions. Second operand 3 states. [2018-10-26 21:12:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:29,250 INFO L93 Difference]: Finished difference Result 8722 states and 11408 transitions. [2018-10-26 21:12:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:12:29,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-26 21:12:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:29,274 INFO L225 Difference]: With dead ends: 8722 [2018-10-26 21:12:29,274 INFO L226 Difference]: Without dead ends: 5287 [2018-10-26 21:12:29,279 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 21:12:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2018-10-26 21:12:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 5287. [2018-10-26 21:12:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5287 states. [2018-10-26 21:12:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 6621 transitions. [2018-10-26 21:12:29,362 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 6621 transitions. Word has length 256 [2018-10-26 21:12:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:29,363 INFO L481 AbstractCegarLoop]: Abstraction has 5287 states and 6621 transitions. [2018-10-26 21:12:29,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:12:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 6621 transitions. [2018-10-26 21:12:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-26 21:12:29,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:29,370 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:29,370 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:29,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash 297930025, now seen corresponding path program 1 times [2018-10-26 21:12:29,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:29,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 97 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:29,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:12:29,742 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 21:12:29,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:29,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:12:32,044 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_1 Int)) (let ((.cse1 (* 12 v_prenex_1))) (let ((.cse2 (div .cse1 10))) (let ((.cse0 (+ .cse2 1))) (and (<= (+ (div .cse0 5) 99853) c_~a29~0) (< .cse1 0) (not (= 0 (mod (* 2 v_prenex_1) 10))) (< 245 v_prenex_1) (<= 0 .cse0) (<= 0 .cse2)))))) (exists ((v_prenex_25 Int)) (let ((.cse3 (* 12 v_prenex_25))) (let ((.cse4 (div .cse3 10))) (and (<= 0 .cse3) (= 0 (mod .cse4 5)) (< 245 v_prenex_25) (<= 0 (+ .cse4 1)) (<= (+ (div .cse4 5) 99853) c_~a29~0))))) (exists ((v_prenex_13 Int)) (let ((.cse5 (div (* 12 v_prenex_13) 10))) (and (< 245 v_prenex_13) (= 0 (mod (+ .cse5 1) 5)) (<= (+ (div .cse5 5) 99853) c_~a29~0) (= 0 (mod .cse5 5)) (= 0 (mod (* 2 v_prenex_13) 10))))) (exists ((v_prenex_6 Int)) (let ((.cse6 (div (* 12 v_prenex_6) 10))) (let ((.cse7 (+ .cse6 1))) (and (<= (+ (div .cse6 5) 99854) c_~a29~0) (not (= 0 (mod .cse6 5))) (< 245 v_prenex_6) (= 0 (mod (* 2 v_prenex_6) 10)) (< .cse7 0) (< .cse6 0) (not (= 0 (mod .cse7 5))))))) (exists ((v_prenex_4 Int)) (let ((.cse8 (div (* 12 v_prenex_4) 10))) (and (<= (+ (div .cse8 5) 99853) c_~a29~0) (< 245 v_prenex_4) (<= 0 .cse8) (<= 0 (+ .cse8 1)) (= 0 (mod (* 2 v_prenex_4) 10))))) (exists ((v_prenex_26 Int)) (let ((.cse9 (div (* 12 v_prenex_26) 10))) (and (= 0 (mod (* 2 v_prenex_26) 10)) (< .cse9 0) (not (= 0 (mod .cse9 5))) (= 0 (mod (+ .cse9 1) 5)) (<= (+ (div .cse9 5) 99854) c_~a29~0) (< 245 v_prenex_26)))) (exists ((v_prenex_17 Int)) (let ((.cse12 (* 12 v_prenex_17))) (let ((.cse11 (div .cse12 10))) (let ((.cse10 (+ .cse11 1))) (and (not (= 0 (mod (* 2 v_prenex_17) 10))) (= 0 (mod .cse10 5)) (< 245 v_prenex_17) (not (= 0 (mod .cse11 5))) (<= (+ (div .cse10 5) 99853) c_~a29~0) (< .cse12 0) (< .cse11 0)))))) (exists ((v_~a29~0_499 Int)) (let ((.cse13 (* 12 v_~a29~0_499))) (let ((.cse15 (div .cse13 10))) (let ((.cse14 (+ .cse15 1))) (and (not (= 0 (mod (* 2 v_~a29~0_499) 10))) (< .cse13 0) (< 245 v_~a29~0_499) (<= (+ (div .cse14 5) 99853) c_~a29~0) (not (= 0 (mod .cse15 5))) (<= 0 .cse14) (< .cse15 0)))))) (exists ((v_prenex_7 Int)) (let ((.cse17 (* 12 v_prenex_7))) (let ((.cse16 (div .cse17 10))) (let ((.cse18 (+ .cse16 1))) (and (<= (+ (div .cse16 5) 99853) c_~a29~0) (<= 0 .cse17) (not (= 0 (mod .cse18 5))) (= 0 (mod .cse16 5)) (< .cse18 0) (< 245 v_prenex_7)))))) (exists ((v_prenex_20 Int)) (let ((.cse20 (* 12 v_prenex_20))) (let ((.cse19 (div .cse20 10))) (and (<= 0 .cse19) (< 245 v_prenex_20) (= 0 (mod (+ .cse19 1) 5)) (<= 0 .cse20) (<= (+ (div .cse19 5) 99853) c_~a29~0))))) (exists ((v_prenex_11 Int)) (let ((.cse22 (* 12 v_prenex_11))) (let ((.cse21 (div .cse22 10))) (let ((.cse23 (+ .cse21 1))) (and (< .cse21 0) (not (= 0 (mod (* 2 v_prenex_11) 10))) (< .cse22 0) (<= (+ (div .cse23 5) 99854) c_~a29~0) (< 245 v_prenex_11) (< .cse23 0) (not (= 0 (mod .cse21 5))) (not (= 0 (mod .cse23 5)))))))) (exists ((v_prenex_8 Int)) (let ((.cse26 (* 12 v_prenex_8))) (let ((.cse25 (div .cse26 10))) (let ((.cse24 (+ .cse25 1))) (and (not (= 0 (mod .cse24 5))) (<= (+ (div .cse24 5) 99854) c_~a29~0) (not (= 0 (mod (* 2 v_prenex_8) 10))) (<= 0 .cse25) (< .cse26 0) (< 245 v_prenex_8) (< .cse24 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse28 (* 12 v_prenex_2))) (let ((.cse29 (div .cse28 10))) (let ((.cse27 (+ .cse29 1))) (and (= 0 (mod .cse27 5)) (<= (+ (div .cse27 5) 99853) c_~a29~0) (< 245 v_prenex_2) (< .cse28 0) (= 0 (mod .cse29 5)) (not (= 0 (mod (* 2 v_prenex_2) 10)))))))) (exists ((v_prenex_3 Int)) (let ((.cse30 (div (* 12 v_prenex_3) 10))) (and (< .cse30 0) (= 0 (mod (* 2 v_prenex_3) 10)) (<= (+ (div .cse30 5) 99854) c_~a29~0) (<= 0 (+ .cse30 1)) (< 245 v_prenex_3) (not (= 0 (mod .cse30 5)))))) (exists ((v_prenex_22 Int)) (let ((.cse31 (div (* 12 v_prenex_22) 10))) (and (< 245 v_prenex_22) (= 0 (mod (+ .cse31 1) 5)) (= 0 (mod (* 2 v_prenex_22) 10)) (<= 0 .cse31) (<= (+ (div .cse31 5) 99853) c_~a29~0)))) (exists ((v_prenex_14 Int)) (let ((.cse34 (* 12 v_prenex_14))) (let ((.cse32 (div .cse34 10))) (let ((.cse33 (+ .cse32 1))) (and (<= (+ (div .cse32 5) 99854) c_~a29~0) (< 245 v_prenex_14) (not (= 0 (mod .cse33 5))) (<= 0 .cse34) (not (= 0 (mod .cse32 5))) (< .cse33 0) (< .cse32 0)))))) (exists ((v_prenex_9 Int)) (let ((.cse35 (* 12 v_prenex_9))) (let ((.cse37 (div .cse35 10))) (let ((.cse36 (+ .cse37 1))) (and (< .cse35 0) (<= (+ (div .cse36 5) 99853) c_~a29~0) (<= 0 .cse36) (< 245 v_prenex_9) (= 0 (mod .cse37 5)) (not (= 0 (mod (* 2 v_prenex_9) 10)))))))) (exists ((v_prenex_19 Int)) (let ((.cse38 (div (* 12 v_prenex_19) 10))) (and (<= (+ (div .cse38 5) 99853) c_~a29~0) (= 0 (mod (* 2 v_prenex_19) 10)) (< 245 v_prenex_19) (= 0 (mod .cse38 5)) (<= 0 (+ .cse38 1))))) (exists ((v_prenex_10 Int)) (let ((.cse40 (div (* 12 v_prenex_10) 10))) (let ((.cse39 (+ .cse40 1))) (and (< 245 v_prenex_10) (< .cse39 0) (<= (+ (div .cse40 5) 99853) c_~a29~0) (= 0 (mod .cse40 5)) (not (= 0 (mod .cse39 5))) (= 0 (mod (* 2 v_prenex_10) 10)))))) (exists ((v_prenex_24 Int)) (let ((.cse43 (* 12 v_prenex_24))) (let ((.cse41 (div .cse43 10))) (let ((.cse42 (+ .cse41 1))) (and (< 245 v_prenex_24) (<= (+ (div .cse41 5) 99853) c_~a29~0) (< .cse42 0) (not (= 0 (mod .cse42 5))) (<= 0 .cse43) (<= 0 .cse41)))))) (exists ((v_prenex_16 Int)) (let ((.cse44 (div (* 12 v_prenex_16) 10))) (let ((.cse45 (+ .cse44 1))) (and (<= (+ (div .cse44 5) 99853) c_~a29~0) (< 245 v_prenex_16) (<= 0 .cse44) (not (= 0 (mod .cse45 5))) (< .cse45 0) (= 0 (mod (* 2 v_prenex_16) 10)))))) (exists ((v_prenex_5 Int)) (let ((.cse46 (* 12 v_prenex_5))) (let ((.cse47 (div .cse46 10))) (let ((.cse48 (+ .cse47 1))) (and (< .cse46 0) (not (= 0 (mod (* 2 v_prenex_5) 10))) (< 245 v_prenex_5) (= 0 (mod .cse47 5)) (< .cse48 0) (<= (+ (div .cse48 5) 99854) c_~a29~0) (not (= 0 (mod .cse48 5)))))))) (exists ((v_prenex_21 Int)) (let ((.cse50 (* 12 v_prenex_21))) (let ((.cse49 (div .cse50 10))) (and (= 0 (mod (+ .cse49 1) 5)) (< 245 v_prenex_21) (not (= 0 (mod .cse49 5))) (<= 0 .cse50) (< .cse49 0) (<= (+ (div .cse49 5) 99854) c_~a29~0))))) (exists ((v_prenex_15 Int)) (let ((.cse53 (* 12 v_prenex_15))) (let ((.cse51 (div .cse53 10))) (let ((.cse52 (+ .cse51 1))) (and (not (= 0 (mod (* 2 v_prenex_15) 10))) (<= 0 .cse51) (<= (+ (div .cse52 5) 99853) c_~a29~0) (= 0 (mod .cse52 5)) (< .cse53 0) (< 245 v_prenex_15)))))) (exists ((v_prenex_12 Int)) (let ((.cse55 (* 12 v_prenex_12))) (let ((.cse54 (div .cse55 10))) (and (<= (+ (div .cse54 5) 99853) c_~a29~0) (= 0 (mod .cse54 5)) (= 0 (mod (+ .cse54 1) 5)) (<= 0 .cse55) (< 245 v_prenex_12))))) (exists ((v_prenex_18 Int)) (let ((.cse57 (* 12 v_prenex_18))) (let ((.cse56 (div .cse57 10))) (and (<= 0 .cse56) (<= 0 .cse57) (<= (+ (div .cse56 5) 99853) c_~a29~0) (< 245 v_prenex_18) (<= 0 (+ .cse56 1)))))) (exists ((v_prenex_23 Int)) (let ((.cse59 (* 12 v_prenex_23))) (let ((.cse58 (div .cse59 10))) (and (< 245 v_prenex_23) (< .cse58 0) (not (= 0 (mod .cse58 5))) (<= 0 .cse59) (<= (+ (div .cse58 5) 99854) c_~a29~0) (<= 0 (+ .cse58 1))))))) is different from false [2018-10-26 21:12:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 21:12:36,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:12:36,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 21:12:36,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:12:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:12:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-10-26 21:12:36,068 INFO L87 Difference]: Start difference. First operand 5287 states and 6621 transitions. Second operand 6 states. [2018-10-26 21:12:43,043 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 21 [2018-10-26 21:12:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:46,145 INFO L93 Difference]: Finished difference Result 18257 states and 22937 transitions. [2018-10-26 21:12:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:12:46,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2018-10-26 21:12:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:46,205 INFO L225 Difference]: With dead ends: 18257 [2018-10-26 21:12:46,206 INFO L226 Difference]: Without dead ends: 13157 [2018-10-26 21:12:46,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-10-26 21:12:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13157 states. [2018-10-26 21:12:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13157 to 7372. [2018-10-26 21:12:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7372 states. [2018-10-26 21:12:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 9064 transitions. [2018-10-26 21:12:46,382 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 9064 transitions. Word has length 262 [2018-10-26 21:12:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:46,382 INFO L481 AbstractCegarLoop]: Abstraction has 7372 states and 9064 transitions. [2018-10-26 21:12:46,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:12:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 9064 transitions. [2018-10-26 21:12:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-26 21:12:46,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:46,392 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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 21:12:46,392 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:46,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 835350734, now seen corresponding path program 1 times [2018-10-26 21:12:46,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:46,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:46,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:46,855 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-26 21:12:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:46,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:12:46,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:12:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:12:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:12:46,926 INFO L87 Difference]: Start difference. First operand 7372 states and 9064 transitions. Second operand 5 states. [2018-10-26 21:12:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:51,009 INFO L93 Difference]: Finished difference Result 19962 states and 24716 transitions. [2018-10-26 21:12:51,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:12:51,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2018-10-26 21:12:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:51,043 INFO L225 Difference]: With dead ends: 19962 [2018-10-26 21:12:51,043 INFO L226 Difference]: Without dead ends: 12777 [2018-10-26 21:12:51,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:12:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12777 states. [2018-10-26 21:12:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12777 to 12212. [2018-10-26 21:12:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12212 states. [2018-10-26 21:12:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 14421 transitions. [2018-10-26 21:12:51,236 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 14421 transitions. Word has length 272 [2018-10-26 21:12:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:51,237 INFO L481 AbstractCegarLoop]: Abstraction has 12212 states and 14421 transitions. [2018-10-26 21:12:51,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:12:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 14421 transitions. [2018-10-26 21:12:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-26 21:12:51,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:51,246 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:51,246 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:51,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:51,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1689117726, now seen corresponding path program 1 times [2018-10-26 21:12:51,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:51,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:51,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:51,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:51,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 151 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 21:12:51,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:12:51,503 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 21:12:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:51,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:12:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 21:12:51,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:12:51,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-26 21:12:51,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:51,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:51,713 INFO L87 Difference]: Start difference. First operand 12212 states and 14421 transitions. Second operand 4 states. [2018-10-26 21:12:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:53,083 INFO L93 Difference]: Finished difference Result 24235 states and 28647 transitions. [2018-10-26 21:12:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:12:53,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-10-26 21:12:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:53,105 INFO L225 Difference]: With dead ends: 24235 [2018-10-26 21:12:53,105 INFO L226 Difference]: Without dead ends: 12210 [2018-10-26 21:12:53,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 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 21:12:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12210 states. [2018-10-26 21:12:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12210 to 11840. [2018-10-26 21:12:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11840 states. [2018-10-26 21:12:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11840 states to 11840 states and 13567 transitions. [2018-10-26 21:12:53,274 INFO L78 Accepts]: Start accepts. Automaton has 11840 states and 13567 transitions. Word has length 283 [2018-10-26 21:12:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:53,275 INFO L481 AbstractCegarLoop]: Abstraction has 11840 states and 13567 transitions. [2018-10-26 21:12:53,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11840 states and 13567 transitions. [2018-10-26 21:12:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 21:12:53,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:53,285 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:53,285 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1097236926, now seen corresponding path program 1 times [2018-10-26 21:12:53,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:53,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:53,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:12:53,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:53,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:12:53,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:12:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:12:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:53,614 INFO L87 Difference]: Start difference. First operand 11840 states and 13567 transitions. Second operand 4 states. [2018-10-26 21:12:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:55,149 INFO L93 Difference]: Finished difference Result 24623 states and 28218 transitions. [2018-10-26 21:12:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:12:55,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-10-26 21:12:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:55,168 INFO L225 Difference]: With dead ends: 24623 [2018-10-26 21:12:55,168 INFO L226 Difference]: Without dead ends: 12970 [2018-10-26 21:12:55,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:12:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2018-10-26 21:12:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12397. [2018-10-26 21:12:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12397 states. [2018-10-26 21:12:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12397 states to 12397 states and 14161 transitions. [2018-10-26 21:12:55,340 INFO L78 Accepts]: Start accepts. Automaton has 12397 states and 14161 transitions. Word has length 286 [2018-10-26 21:12:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:55,341 INFO L481 AbstractCegarLoop]: Abstraction has 12397 states and 14161 transitions. [2018-10-26 21:12:55,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:12:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 12397 states and 14161 transitions. [2018-10-26 21:12:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-26 21:12:55,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:55,353 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:55,353 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:55,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1928928753, now seen corresponding path program 1 times [2018-10-26 21:12:55,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:55,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:55,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 21:12:55,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:55,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:12:55,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:12:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:12:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:12:55,707 INFO L87 Difference]: Start difference. First operand 12397 states and 14161 transitions. Second operand 3 states. [2018-10-26 21:12:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:57,100 INFO L93 Difference]: Finished difference Result 29972 states and 34199 transitions. [2018-10-26 21:12:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:12:57,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-10-26 21:12:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:57,119 INFO L225 Difference]: With dead ends: 29972 [2018-10-26 21:12:57,119 INFO L226 Difference]: Without dead ends: 16455 [2018-10-26 21:12:57,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 21:12:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2018-10-26 21:12:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 15900. [2018-10-26 21:12:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15900 states. [2018-10-26 21:12:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 17739 transitions. [2018-10-26 21:12:57,330 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 17739 transitions. Word has length 315 [2018-10-26 21:12:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:57,331 INFO L481 AbstractCegarLoop]: Abstraction has 15900 states and 17739 transitions. [2018-10-26 21:12:57,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:12:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 17739 transitions. [2018-10-26 21:12:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-26 21:12:57,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:57,348 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:12:57,348 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:57,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1132583105, now seen corresponding path program 1 times [2018-10-26 21:12:57,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:57,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:12:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 21:12:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:12:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:12:57,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:12:57,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:12:57,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:12:57,702 INFO L87 Difference]: Start difference. First operand 15900 states and 17739 transitions. Second operand 3 states. [2018-10-26 21:12:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:12:59,413 INFO L93 Difference]: Finished difference Result 31985 states and 35717 transitions. [2018-10-26 21:12:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:12:59,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-26 21:12:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:12:59,426 INFO L225 Difference]: With dead ends: 31985 [2018-10-26 21:12:59,426 INFO L226 Difference]: Without dead ends: 14406 [2018-10-26 21:12:59,436 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 21:12:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14406 states. [2018-10-26 21:12:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14406 to 14035. [2018-10-26 21:12:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14035 states. [2018-10-26 21:12:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14035 states to 14035 states and 15525 transitions. [2018-10-26 21:12:59,596 INFO L78 Accepts]: Start accepts. Automaton has 14035 states and 15525 transitions. Word has length 341 [2018-10-26 21:12:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:12:59,596 INFO L481 AbstractCegarLoop]: Abstraction has 14035 states and 15525 transitions. [2018-10-26 21:12:59,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:12:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14035 states and 15525 transitions. [2018-10-26 21:12:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-26 21:12:59,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:12:59,607 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:12:59,607 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:12:59,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:12:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2048231361, now seen corresponding path program 1 times [2018-10-26 21:12:59,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:12:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:12:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:12:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:12:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:00,178 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-26 21:13:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 21:13:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:13:00,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:13:00,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:13:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:13:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:00,258 INFO L87 Difference]: Start difference. First operand 14035 states and 15525 transitions. Second operand 4 states. [2018-10-26 21:13:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:01,826 INFO L93 Difference]: Finished difference Result 27697 states and 30680 transitions. [2018-10-26 21:13:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:13:01,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-26 21:13:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:01,838 INFO L225 Difference]: With dead ends: 27697 [2018-10-26 21:13:01,838 INFO L226 Difference]: Without dead ends: 12909 [2018-10-26 21:13:01,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2018-10-26 21:13:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12722. [2018-10-26 21:13:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12722 states. [2018-10-26 21:13:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12722 states to 12722 states and 13948 transitions. [2018-10-26 21:13:01,992 INFO L78 Accepts]: Start accepts. Automaton has 12722 states and 13948 transitions. Word has length 342 [2018-10-26 21:13:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:01,992 INFO L481 AbstractCegarLoop]: Abstraction has 12722 states and 13948 transitions. [2018-10-26 21:13:01,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:13:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12722 states and 13948 transitions. [2018-10-26 21:13:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-26 21:13:02,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:02,005 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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 21:13:02,005 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:02,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1788547456, now seen corresponding path program 1 times [2018-10-26 21:13:02,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:02,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:02,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:02,570 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 21:13:02,943 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-26 21:13:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 57 proven. 293 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 21:13:03,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:03,369 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) [2018-10-26 21:13:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:03,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:03,800 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 21:13:04,278 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-26 21:13:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 65 proven. 285 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-26 21:13:04,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-10-26 21:13:04,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:13:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:13:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:13:04,786 INFO L87 Difference]: Start difference. First operand 12722 states and 13948 transitions. Second operand 11 states. [2018-10-26 21:13:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:10,870 INFO L93 Difference]: Finished difference Result 28403 states and 31169 transitions. [2018-10-26 21:13:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:13:10,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 379 [2018-10-26 21:13:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:10,890 INFO L225 Difference]: With dead ends: 28403 [2018-10-26 21:13:10,890 INFO L226 Difference]: Without dead ends: 15868 [2018-10-26 21:13:10,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:13:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15868 states. [2018-10-26 21:13:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15868 to 12533. [2018-10-26 21:13:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12533 states. [2018-10-26 21:13:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 13607 transitions. [2018-10-26 21:13:11,057 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 13607 transitions. Word has length 379 [2018-10-26 21:13:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:11,058 INFO L481 AbstractCegarLoop]: Abstraction has 12533 states and 13607 transitions. [2018-10-26 21:13:11,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:13:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 13607 transitions. [2018-10-26 21:13:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-26 21:13:11,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:11,068 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:13:11,069 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:11,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash -390299597, now seen corresponding path program 1 times [2018-10-26 21:13:11,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-26 21:13:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:13:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:13:11,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:13:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:13:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:11,453 INFO L87 Difference]: Start difference. First operand 12533 states and 13607 transitions. Second operand 4 states. [2018-10-26 21:13:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:13,163 INFO L93 Difference]: Finished difference Result 25445 states and 27637 transitions. [2018-10-26 21:13:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:13:13,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-10-26 21:13:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:13,174 INFO L225 Difference]: With dead ends: 25445 [2018-10-26 21:13:13,174 INFO L226 Difference]: Without dead ends: 13099 [2018-10-26 21:13:13,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:13:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13099 states. [2018-10-26 21:13:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13099 to 12718. [2018-10-26 21:13:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12718 states. [2018-10-26 21:13:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 13768 transitions. [2018-10-26 21:13:13,316 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 13768 transitions. Word has length 385 [2018-10-26 21:13:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:13,316 INFO L481 AbstractCegarLoop]: Abstraction has 12718 states and 13768 transitions. [2018-10-26 21:13:13,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:13:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 13768 transitions. [2018-10-26 21:13:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-26 21:13:13,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:13,324 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 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 21:13:13,325 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -971100732, now seen corresponding path program 1 times [2018-10-26 21:13:13,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:13,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 454 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:13:13,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:13,875 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:13,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-26 21:13:14,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:13:14,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-26 21:13:14,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:13:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:13:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:13:14,251 INFO L87 Difference]: Start difference. First operand 12718 states and 13768 transitions. Second operand 6 states. [2018-10-26 21:13:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:16,199 INFO L93 Difference]: Finished difference Result 25253 states and 27350 transitions. [2018-10-26 21:13:16,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:13:16,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 390 [2018-10-26 21:13:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:16,210 INFO L225 Difference]: With dead ends: 25253 [2018-10-26 21:13:16,210 INFO L226 Difference]: Without dead ends: 12722 [2018-10-26 21:13:16,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:13:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12722 states. [2018-10-26 21:13:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12722 to 12718. [2018-10-26 21:13:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12718 states. [2018-10-26 21:13:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 13762 transitions. [2018-10-26 21:13:16,343 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 13762 transitions. Word has length 390 [2018-10-26 21:13:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:16,344 INFO L481 AbstractCegarLoop]: Abstraction has 12718 states and 13762 transitions. [2018-10-26 21:13:16,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:13:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 13762 transitions. [2018-10-26 21:13:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-26 21:13:16,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:16,357 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:13:16,357 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:16,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1710354276, now seen corresponding path program 1 times [2018-10-26 21:13:16,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:16,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:16,847 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-26 21:13:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 324 proven. 103 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 21:13:16,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:16,959 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:17,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 324 proven. 103 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 21:13:17,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:17,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-26 21:13:17,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:13:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:13:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:13:17,211 INFO L87 Difference]: Start difference. First operand 12718 states and 13762 transitions. Second operand 5 states. [2018-10-26 21:13:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:19,385 INFO L93 Difference]: Finished difference Result 28776 states and 31132 transitions. [2018-10-26 21:13:19,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:13:19,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 409 [2018-10-26 21:13:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:19,400 INFO L225 Difference]: With dead ends: 28776 [2018-10-26 21:13:19,400 INFO L226 Difference]: Without dead ends: 16245 [2018-10-26 21:13:19,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:13:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16245 states. [2018-10-26 21:13:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16245 to 14938. [2018-10-26 21:13:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14938 states. [2018-10-26 21:13:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14938 states to 14938 states and 16091 transitions. [2018-10-26 21:13:19,649 INFO L78 Accepts]: Start accepts. Automaton has 14938 states and 16091 transitions. Word has length 409 [2018-10-26 21:13:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:19,649 INFO L481 AbstractCegarLoop]: Abstraction has 14938 states and 16091 transitions. [2018-10-26 21:13:19,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:13:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 14938 states and 16091 transitions. [2018-10-26 21:13:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-26 21:13:19,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:19,660 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:13:19,660 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:19,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash 860584526, now seen corresponding path program 1 times [2018-10-26 21:13:19,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:19,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 21:13:20,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:13:20,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:13:20,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:13:20,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:13:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:13:20,063 INFO L87 Difference]: Start difference. First operand 14938 states and 16091 transitions. Second operand 5 states. [2018-10-26 21:13:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:22,537 INFO L93 Difference]: Finished difference Result 38388 states and 41278 transitions. [2018-10-26 21:13:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:13:22,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-10-26 21:13:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:22,557 INFO L225 Difference]: With dead ends: 38388 [2018-10-26 21:13:22,558 INFO L226 Difference]: Without dead ends: 22527 [2018-10-26 21:13:22,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:13:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2018-10-26 21:13:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 21784. [2018-10-26 21:13:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21784 states. [2018-10-26 21:13:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21784 states to 21784 states and 23248 transitions. [2018-10-26 21:13:22,768 INFO L78 Accepts]: Start accepts. Automaton has 21784 states and 23248 transitions. Word has length 418 [2018-10-26 21:13:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:22,768 INFO L481 AbstractCegarLoop]: Abstraction has 21784 states and 23248 transitions. [2018-10-26 21:13:22,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:13:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21784 states and 23248 transitions. [2018-10-26 21:13:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-26 21:13:22,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:22,775 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:13:22,775 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:22,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1078402377, now seen corresponding path program 1 times [2018-10-26 21:13:22,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:22,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:22,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:22,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:22,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 252 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:13:23,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:23,737 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:23,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:23,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 252 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:13:25,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-26 21:13:25,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:13:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:13:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:13:25,202 INFO L87 Difference]: Start difference. First operand 21784 states and 23248 transitions. Second operand 12 states. [2018-10-26 21:13:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:35,823 INFO L93 Difference]: Finished difference Result 48267 states and 51396 transitions. [2018-10-26 21:13:35,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 21:13:35,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 421 [2018-10-26 21:13:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:35,846 INFO L225 Difference]: With dead ends: 48267 [2018-10-26 21:13:35,846 INFO L226 Difference]: Without dead ends: 26670 [2018-10-26 21:13:35,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-10-26 21:13:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26670 states. [2018-10-26 21:13:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26670 to 21776. [2018-10-26 21:13:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21776 states. [2018-10-26 21:13:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21776 states to 21776 states and 23177 transitions. [2018-10-26 21:13:36,129 INFO L78 Accepts]: Start accepts. Automaton has 21776 states and 23177 transitions. Word has length 421 [2018-10-26 21:13:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:36,130 INFO L481 AbstractCegarLoop]: Abstraction has 21776 states and 23177 transitions. [2018-10-26 21:13:36,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:13:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 21776 states and 23177 transitions. [2018-10-26 21:13:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-26 21:13:36,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:36,141 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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 21:13:36,141 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:36,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1386335279, now seen corresponding path program 1 times [2018-10-26 21:13:36,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:36,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:36,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:36,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:36,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:36,573 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-26 21:13:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-26 21:13:36,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:13:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:13:36,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:13:36,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:13:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:36,719 INFO L87 Difference]: Start difference. First operand 21776 states and 23177 transitions. Second operand 4 states. [2018-10-26 21:13:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:38,558 INFO L93 Difference]: Finished difference Result 43746 states and 46555 transitions. [2018-10-26 21:13:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:13:38,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2018-10-26 21:13:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:38,575 INFO L225 Difference]: With dead ends: 43746 [2018-10-26 21:13:38,575 INFO L226 Difference]: Without dead ends: 19552 [2018-10-26 21:13:38,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19552 states. [2018-10-26 21:13:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19552 to 17689. [2018-10-26 21:13:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17689 states. [2018-10-26 21:13:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17689 states to 17689 states and 18789 transitions. [2018-10-26 21:13:38,761 INFO L78 Accepts]: Start accepts. Automaton has 17689 states and 18789 transitions. Word has length 481 [2018-10-26 21:13:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:38,762 INFO L481 AbstractCegarLoop]: Abstraction has 17689 states and 18789 transitions. [2018-10-26 21:13:38,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:13:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17689 states and 18789 transitions. [2018-10-26 21:13:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-26 21:13:38,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:38,771 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 21:13:38,771 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:38,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1978485628, now seen corresponding path program 1 times [2018-10-26 21:13:38,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:38,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:38,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:38,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 605 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-10-26 21:13:40,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:40,336 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:40,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 245 proven. 459 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-26 21:13:40,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:40,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 21:13:40,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:13:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:13:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:13:40,964 INFO L87 Difference]: Start difference. First operand 17689 states and 18789 transitions. Second operand 9 states. [2018-10-26 21:13:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:46,740 INFO L93 Difference]: Finished difference Result 45569 states and 48351 transitions. [2018-10-26 21:13:46,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:13:46,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 577 [2018-10-26 21:13:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:46,764 INFO L225 Difference]: With dead ends: 45569 [2018-10-26 21:13:46,765 INFO L226 Difference]: Without dead ends: 28067 [2018-10-26 21:13:46,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:13:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28067 states. [2018-10-26 21:13:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28067 to 23062. [2018-10-26 21:13:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23062 states. [2018-10-26 21:13:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23062 states to 23062 states and 24472 transitions. [2018-10-26 21:13:47,007 INFO L78 Accepts]: Start accepts. Automaton has 23062 states and 24472 transitions. Word has length 577 [2018-10-26 21:13:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:47,008 INFO L481 AbstractCegarLoop]: Abstraction has 23062 states and 24472 transitions. [2018-10-26 21:13:47,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:13:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 23062 states and 24472 transitions. [2018-10-26 21:13:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-26 21:13:47,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:47,023 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:13:47,024 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:47,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1987667603, now seen corresponding path program 1 times [2018-10-26 21:13:47,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:47,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 762 proven. 239 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-10-26 21:13:47,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:47,937 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:47,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:48,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 762 proven. 239 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-10-26 21:13:48,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:48,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-26 21:13:48,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:13:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:13:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:13:48,620 INFO L87 Difference]: Start difference. First operand 23062 states and 24472 transitions. Second operand 5 states. [2018-10-26 21:13:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:51,044 INFO L93 Difference]: Finished difference Result 46496 states and 49320 transitions. [2018-10-26 21:13:51,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:13:51,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 649 [2018-10-26 21:13:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:51,066 INFO L225 Difference]: With dead ends: 46496 [2018-10-26 21:13:51,066 INFO L226 Difference]: Without dead ends: 21378 [2018-10-26 21:13:51,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 648 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:13:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21378 states. [2018-10-26 21:13:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21378 to 16517. [2018-10-26 21:13:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16517 states. [2018-10-26 21:13:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16517 states to 16517 states and 17439 transitions. [2018-10-26 21:13:51,271 INFO L78 Accepts]: Start accepts. Automaton has 16517 states and 17439 transitions. Word has length 649 [2018-10-26 21:13:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:51,272 INFO L481 AbstractCegarLoop]: Abstraction has 16517 states and 17439 transitions. [2018-10-26 21:13:51,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:13:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 16517 states and 17439 transitions. [2018-10-26 21:13:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2018-10-26 21:13:51,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:51,285 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-26 21:13:51,285 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:51,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1344036501, now seen corresponding path program 1 times [2018-10-26 21:13:51,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:51,802 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 21:13:52,056 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-26 21:13:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-10-26 21:13:52,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:13:52,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:13:52,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:13:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:13:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:52,332 INFO L87 Difference]: Start difference. First operand 16517 states and 17439 transitions. Second operand 4 states. [2018-10-26 21:13:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:13:53,913 INFO L93 Difference]: Finished difference Result 31004 states and 32757 transitions. [2018-10-26 21:13:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:13:53,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 718 [2018-10-26 21:13:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:13:53,930 INFO L225 Difference]: With dead ends: 31004 [2018-10-26 21:13:53,930 INFO L226 Difference]: Without dead ends: 16894 [2018-10-26 21:13:53,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:13:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16894 states. [2018-10-26 21:13:54,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16894 to 16517. [2018-10-26 21:13:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16517 states. [2018-10-26 21:13:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16517 states to 16517 states and 17430 transitions. [2018-10-26 21:13:54,117 INFO L78 Accepts]: Start accepts. Automaton has 16517 states and 17430 transitions. Word has length 718 [2018-10-26 21:13:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:13:54,118 INFO L481 AbstractCegarLoop]: Abstraction has 16517 states and 17430 transitions. [2018-10-26 21:13:54,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:13:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16517 states and 17430 transitions. [2018-10-26 21:13:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-26 21:13:54,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:13:54,128 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:13:54,128 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:13:54,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:13:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1879709056, now seen corresponding path program 1 times [2018-10-26 21:13:54,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:13:54,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:13:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:13:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:55,284 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-26 21:13:55,782 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-10-26 21:13:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 641 proven. 620 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-10-26 21:13:57,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:13:57,287 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:13:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:13:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:13:57,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:13:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 830 proven. 5 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-26 21:13:59,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:13:59,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-10-26 21:13:59,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:13:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:13:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:13:59,166 INFO L87 Difference]: Start difference. First operand 16517 states and 17430 transitions. Second operand 12 states. [2018-10-26 21:14:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:04,206 INFO L93 Difference]: Finished difference Result 30749 states and 32463 transitions. [2018-10-26 21:14:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:14:04,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 758 [2018-10-26 21:14:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:04,220 INFO L225 Difference]: With dead ends: 30749 [2018-10-26 21:14:04,220 INFO L226 Difference]: Without dead ends: 16639 [2018-10-26 21:14:04,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 755 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:14:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16639 states. [2018-10-26 21:14:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16639 to 16331. [2018-10-26 21:14:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2018-10-26 21:14:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 17205 transitions. [2018-10-26 21:14:04,386 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 17205 transitions. Word has length 758 [2018-10-26 21:14:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:04,387 INFO L481 AbstractCegarLoop]: Abstraction has 16331 states and 17205 transitions. [2018-10-26 21:14:04,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:14:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 17205 transitions. [2018-10-26 21:14:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2018-10-26 21:14:04,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:04,397 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 21:14:04,397 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:04,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1988270976, now seen corresponding path program 1 times [2018-10-26 21:14:04,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:05,089 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-26 21:14:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 931 proven. 0 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2018-10-26 21:14:05,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:14:05,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:14:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:14:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:14:05,302 INFO L87 Difference]: Start difference. First operand 16331 states and 17205 transitions. Second operand 4 states. [2018-10-26 21:14:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:06,985 INFO L93 Difference]: Finished difference Result 33594 states and 35358 transitions. [2018-10-26 21:14:06,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:14:06,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 838 [2018-10-26 21:14:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:07,002 INFO L225 Difference]: With dead ends: 33594 [2018-10-26 21:14:07,002 INFO L226 Difference]: Without dead ends: 19670 [2018-10-26 21:14:07,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:14:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19670 states. [2018-10-26 21:14:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19670 to 16331. [2018-10-26 21:14:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2018-10-26 21:14:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 17165 transitions. [2018-10-26 21:14:07,193 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 17165 transitions. Word has length 838 [2018-10-26 21:14:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:07,193 INFO L481 AbstractCegarLoop]: Abstraction has 16331 states and 17165 transitions. [2018-10-26 21:14:07,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:14:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 17165 transitions. [2018-10-26 21:14:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2018-10-26 21:14:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:07,204 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:14:07,204 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:07,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2123115192, now seen corresponding path program 1 times [2018-10-26 21:14:07,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:07,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:07,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:07,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:07,945 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:14:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1337 proven. 220 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2018-10-26 21:14:08,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:14:08,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:14:08,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:08,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:14:09,057 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 24 [2018-10-26 21:14:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1298 proven. 97 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-10-26 21:14:10,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:14:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-10-26 21:14:10,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:14:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:14:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:14:10,324 INFO L87 Difference]: Start difference. First operand 16331 states and 17165 transitions. Second operand 8 states. [2018-10-26 21:14:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:14,470 INFO L93 Difference]: Finished difference Result 40447 states and 42542 transitions. [2018-10-26 21:14:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:14:14,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 852 [2018-10-26 21:14:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:14,493 INFO L225 Difference]: With dead ends: 40447 [2018-10-26 21:14:14,493 INFO L226 Difference]: Without dead ends: 26151 [2018-10-26 21:14:14,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:14:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26151 states. [2018-10-26 21:14:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26151 to 14657. [2018-10-26 21:14:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14657 states. [2018-10-26 21:14:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14657 states to 14657 states and 15339 transitions. [2018-10-26 21:14:14,720 INFO L78 Accepts]: Start accepts. Automaton has 14657 states and 15339 transitions. Word has length 852 [2018-10-26 21:14:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:14,720 INFO L481 AbstractCegarLoop]: Abstraction has 14657 states and 15339 transitions. [2018-10-26 21:14:14,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:14:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 14657 states and 15339 transitions. [2018-10-26 21:14:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-10-26 21:14:14,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:14,733 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:14:14,733 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:14,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1611105690, now seen corresponding path program 1 times [2018-10-26 21:14:14,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 2157 proven. 0 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-26 21:14:15,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:15,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:14:15,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:14:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:14:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:14:15,573 INFO L87 Difference]: Start difference. First operand 14657 states and 15339 transitions. Second operand 3 states. [2018-10-26 21:14:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:16,425 INFO L93 Difference]: Finished difference Result 26716 states and 27965 transitions. [2018-10-26 21:14:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:14:16,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 961 [2018-10-26 21:14:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:16,434 INFO L225 Difference]: With dead ends: 26716 [2018-10-26 21:14:16,434 INFO L226 Difference]: Without dead ends: 9638 [2018-10-26 21:14:16,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 21:14:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2018-10-26 21:14:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 7233. [2018-10-26 21:14:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7233 states. [2018-10-26 21:14:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 7446 transitions. [2018-10-26 21:14:16,528 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 7446 transitions. Word has length 961 [2018-10-26 21:14:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:16,529 INFO L481 AbstractCegarLoop]: Abstraction has 7233 states and 7446 transitions. [2018-10-26 21:14:16,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:14:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 7446 transitions. [2018-10-26 21:14:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-10-26 21:14:16,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:16,538 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-26 21:14:16,538 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:16,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash 21786734, now seen corresponding path program 1 times [2018-10-26 21:14:16,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:16,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 1718 proven. 255 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-26 21:14:17,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:14:17,824 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:14:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:18,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:14:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 402 proven. 2019 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-26 21:14:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:14:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-26 21:14:20,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:14:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:14:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:14:20,144 INFO L87 Difference]: Start difference. First operand 7233 states and 7446 transitions. Second operand 13 states. [2018-10-26 21:14:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:26,776 INFO L93 Difference]: Finished difference Result 11495 states and 11846 transitions. [2018-10-26 21:14:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:14:26,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1001 [2018-10-26 21:14:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:26,787 INFO L225 Difference]: With dead ends: 11495 [2018-10-26 21:14:26,787 INFO L226 Difference]: Without dead ends: 11308 [2018-10-26 21:14:26,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1008 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2018-10-26 21:14:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11308 states. [2018-10-26 21:14:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11308 to 5566. [2018-10-26 21:14:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2018-10-26 21:14:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 5724 transitions. [2018-10-26 21:14:26,878 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 5724 transitions. Word has length 1001 [2018-10-26 21:14:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:26,878 INFO L481 AbstractCegarLoop]: Abstraction has 5566 states and 5724 transitions. [2018-10-26 21:14:26,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:14:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 5724 transitions. [2018-10-26 21:14:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2018-10-26 21:14:26,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:26,888 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-10-26 21:14:26,888 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:26,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -748873225, now seen corresponding path program 1 times [2018-10-26 21:14:26,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:26,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:26,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4048 backedges. 2602 proven. 0 refuted. 0 times theorem prover too weak. 1446 trivial. 0 not checked. [2018-10-26 21:14:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:14:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:14:27,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:14:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:14:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:14:27,715 INFO L87 Difference]: Start difference. First operand 5566 states and 5724 transitions. Second operand 3 states. [2018-10-26 21:14:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:14:28,395 INFO L93 Difference]: Finished difference Result 10575 states and 10878 transitions. [2018-10-26 21:14:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:14:28,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1052 [2018-10-26 21:14:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:14:28,399 INFO L225 Difference]: With dead ends: 10575 [2018-10-26 21:14:28,399 INFO L226 Difference]: Without dead ends: 5751 [2018-10-26 21:14:28,402 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 21:14:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2018-10-26 21:14:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4641. [2018-10-26 21:14:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4641 states. [2018-10-26 21:14:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 4764 transitions. [2018-10-26 21:14:28,459 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 4764 transitions. Word has length 1052 [2018-10-26 21:14:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:14:28,460 INFO L481 AbstractCegarLoop]: Abstraction has 4641 states and 4764 transitions. [2018-10-26 21:14:28,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:14:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 4764 transitions. [2018-10-26 21:14:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-26 21:14:28,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:14:28,468 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:14:28,468 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:14:28,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:14:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 81180474, now seen corresponding path program 1 times [2018-10-26 21:14:28,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:14:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:14:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:14:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:29,385 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-26 21:14:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 1923 proven. 286 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-10-26 21:14:30,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:14:30,004 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:14:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:14:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:14:30,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:14:32,771 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2018-10-26 21:14:33,126 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 21:14:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3409 backedges. 1905 proven. 304 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-10-26 21:14:36,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:14:36,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-26 21:14:36,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:14:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:14:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-10-26 21:14:36,353 INFO L87 Difference]: Start difference. First operand 4641 states and 4764 transitions. Second operand 10 states. [2018-10-26 21:14:37,043 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 25 Received shutdown request... [2018-10-26 21:16:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:16:00,560 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 21:16:00,567 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 21:16:00,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:16:00 BoogieIcfgContainer [2018-10-26 21:16:00,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:16:00,569 INFO L168 Benchmark]: Toolchain (without parser) took 237051.37 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-26 21:16:00,570 INFO L168 Benchmark]: CDTParser took 0.23 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 21:16:00,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 981.55 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2018-10-26 21:16:00,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 303.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-10-26 21:16:00,572 INFO L168 Benchmark]: Boogie Preprocessor took 138.61 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:16:00,573 INFO L168 Benchmark]: RCFGBuilder took 4985.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 177.5 MB). Peak memory consumption was 177.5 MB. Max. memory is 7.1 GB. [2018-10-26 21:16:00,574 INFO L168 Benchmark]: TraceAbstraction took 230633.67 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 879.7 MB. Max. memory is 7.1 GB. [2018-10-26 21:16:00,578 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.23 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 981.55 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 303.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.61 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4985.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 177.5 MB). Peak memory consumption was 177.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230633.67 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 879.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 156). Cancelled while BasicCegarLoop was constructing difference of abstraction (4641states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (4718 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 230.5s OverallTime, 29 OverallIterations, 10 TraceHistogramMax, 179.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5736 SDtfs, 18697 SDslu, 3146 SDs, 0 SdLazy, 56445 SolverSat, 6388 SolverUnsat, 102 SolverUnknown, 0 SolverNotchecked, 153.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7246 GetRequests, 7047 SyntacticMatches, 35 SemanticMatches, 164 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23062occurred 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: 4.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 56934 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 21299 NumberOfCodeBlocks, 21299 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 21258 ConstructedInterpolants, 682 QuantifiedInterpolants, 85173625 SizeOfPredicates, 26 NumberOfNonLiveVariables, 9042 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 41 InterpolantComputations, 20 PerfectInterpolantSequences, 37459/44162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown