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-d380424 [2018-10-24 16:07:42,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:07:42,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:07:42,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:07:42,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:07:42,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:07:42,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:07:42,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:07:42,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:07:42,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:07:42,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:07:42,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:07:42,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:07:42,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:07:42,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:07:42,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:07:42,695 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:07:42,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:07:42,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:07:42,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:07:42,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:07:42,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:07:42,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:07:42,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:07:42,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:07:42,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:07:42,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:07:42,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:07:42,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:07:42,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:07:42,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:07:42,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:07:42,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:07:42,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:07:42,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:07:42,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:07:42,714 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:07:42,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:07:42,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:07:42,736 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:07:42,740 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:07:42,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:07:42,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:07:42,741 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:07:42,741 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:07:42,741 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:07:42,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:07:42,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:07:42,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:07:42,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:07:42,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:07:42,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:07:42,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:07:42,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:07:42,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:07:42,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:07:42,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:07:42,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:07:42,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:07:42,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:07:42,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:07:42,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:07:42,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:07:42,745 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:07:42,745 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:07:42,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:07:42,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:07:42,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:07:42,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:07:42,808 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:07:42,809 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-24 16:07:42,869 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4481f8958/caf1f843186c478e8d1cd38fabb872b5/FLAG37f1a2ca6 [2018-10-24 16:07:43,562 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:07:43,566 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label48_true-unreach-call.c [2018-10-24 16:07:43,588 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4481f8958/caf1f843186c478e8d1cd38fabb872b5/FLAG37f1a2ca6 [2018-10-24 16:07:43,603 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4481f8958/caf1f843186c478e8d1cd38fabb872b5 [2018-10-24 16:07:43,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:07:43,616 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:07:43,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:07:43,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:07:43,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:07:43,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:43" (1/1) ... [2018-10-24 16:07:43,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb5160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:43, skipping insertion in model container [2018-10-24 16:07:43,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:43" (1/1) ... [2018-10-24 16:07:43,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:07:43,703 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:07:44,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:07:44,299 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:07:44,469 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:07:44,487 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:07:44,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44 WrapperNode [2018-10-24 16:07:44,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:07:44,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:07:44,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:07:44,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:07:44,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:07:44,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:07:44,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:07:44,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:07:44,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... [2018-10-24 16:07:44,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:07:44,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:07:44,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:07:44,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:07:44,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:07:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:07:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:07:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:07:49,878 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:07:49,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:07:49 BoogieIcfgContainer [2018-10-24 16:07:49,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:07:49,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:07:49,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:07:49,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:07:49,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:07:43" (1/3) ... [2018-10-24 16:07:49,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a9f054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:07:49, skipping insertion in model container [2018-10-24 16:07:49,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:44" (2/3) ... [2018-10-24 16:07:49,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a9f054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:07:49, skipping insertion in model container [2018-10-24 16:07:49,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:07:49" (3/3) ... [2018-10-24 16:07:49,890 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label48_true-unreach-call.c [2018-10-24 16:07:49,901 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:07:49,910 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:07:49,929 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:07:49,968 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:07:49,969 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:07:49,969 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:07:49,969 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:07:49,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:07:49,970 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:07:49,970 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:07:49,970 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:07:49,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:07:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-24 16:07:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 16:07:50,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:07:50,008 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-24 16:07:50,011 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:07:50,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:07:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1316472986, now seen corresponding path program 1 times [2018-10-24 16:07:50,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:07:50,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:07:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:50,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:07:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:07:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:07:50,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:07:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:07:50,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:07:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:07:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:07:50,559 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-24 16:07:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:07:53,688 INFO L93 Difference]: Finished difference Result 955 states and 1722 transitions. [2018-10-24 16:07:53,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:07:53,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-24 16:07:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:07:53,717 INFO L225 Difference]: With dead ends: 955 [2018-10-24 16:07:53,717 INFO L226 Difference]: Without dead ends: 664 [2018-10-24 16:07:53,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:07:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-24 16:07:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2018-10-24 16:07:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-24 16:07:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 716 transitions. [2018-10-24 16:07:53,826 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 716 transitions. Word has length 51 [2018-10-24 16:07:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:07:53,827 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 716 transitions. [2018-10-24 16:07:53,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:07:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2018-10-24 16:07:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 16:07:53,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:07:53,834 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-24 16:07:53,834 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:07:53,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:07:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash 301697122, now seen corresponding path program 1 times [2018-10-24 16:07:53,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:07:53,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:07:53,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:53,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:07:53,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:07:54,207 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-24 16:07:54,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:07:54,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:07:54,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:07:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:07:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:07:54,211 INFO L87 Difference]: Start difference. First operand 472 states and 716 transitions. Second operand 4 states. [2018-10-24 16:07:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:07:57,672 INFO L93 Difference]: Finished difference Result 1700 states and 2661 transitions. [2018-10-24 16:07:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:07:57,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-10-24 16:07:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:07:57,681 INFO L225 Difference]: With dead ends: 1700 [2018-10-24 16:07:57,681 INFO L226 Difference]: Without dead ends: 1230 [2018-10-24 16:07:57,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:07:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-24 16:07:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1216. [2018-10-24 16:07:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-10-24 16:07:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1756 transitions. [2018-10-24 16:07:57,736 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1756 transitions. Word has length 120 [2018-10-24 16:07:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:07:57,737 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1756 transitions. [2018-10-24 16:07:57,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:07:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1756 transitions. [2018-10-24 16:07:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-24 16:07:57,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:07:57,742 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-24 16:07:57,742 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:07:57,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:07:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -332525066, now seen corresponding path program 1 times [2018-10-24 16:07:57,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:07:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:07:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:57,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:07:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:07:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:07:58,053 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-24 16:07:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:07:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:07:58,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:07:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:07:58,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:07:58,055 INFO L87 Difference]: Start difference. First operand 1216 states and 1756 transitions. Second operand 4 states. [2018-10-24 16:08:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:02,336 INFO L93 Difference]: Finished difference Result 4493 states and 6609 transitions. [2018-10-24 16:08:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:02,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-24 16:08:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:02,354 INFO L225 Difference]: With dead ends: 4493 [2018-10-24 16:08:02,354 INFO L226 Difference]: Without dead ends: 3279 [2018-10-24 16:08:02,357 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-24 16:08:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-10-24 16:08:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2327. [2018-10-24 16:08:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-10-24 16:08:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3050 transitions. [2018-10-24 16:08:02,411 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3050 transitions. Word has length 128 [2018-10-24 16:08:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:02,412 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 3050 transitions. [2018-10-24 16:08:02,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3050 transitions. [2018-10-24 16:08:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-24 16:08:02,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:02,421 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-24 16:08:02,421 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:02,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 650117298, now seen corresponding path program 1 times [2018-10-24 16:08:02,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:02,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:02,684 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-24 16:08:02,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:02,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:08:02,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:08:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:08:02,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:02,686 INFO L87 Difference]: Start difference. First operand 2327 states and 3050 transitions. Second operand 4 states. [2018-10-24 16:08:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:08,263 INFO L93 Difference]: Finished difference Result 5964 states and 7957 transitions. [2018-10-24 16:08:08,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:08,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-10-24 16:08:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:08,280 INFO L225 Difference]: With dead ends: 5964 [2018-10-24 16:08:08,281 INFO L226 Difference]: Without dead ends: 3824 [2018-10-24 16:08:08,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2018-10-24 16:08:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3622. [2018-10-24 16:08:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-10-24 16:08:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4613 transitions. [2018-10-24 16:08:08,349 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4613 transitions. Word has length 241 [2018-10-24 16:08:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:08,350 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 4613 transitions. [2018-10-24 16:08:08,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4613 transitions. [2018-10-24 16:08:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-24 16:08:08,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:08,357 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-24 16:08:08,357 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:08,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1057452654, now seen corresponding path program 1 times [2018-10-24 16:08:08,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:08,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:08,640 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-24 16:08:08,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:08,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 16:08:08,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:08:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:08:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:08,642 INFO L87 Difference]: Start difference. First operand 3622 states and 4613 transitions. Second operand 3 states. [2018-10-24 16:08:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:10,138 INFO L93 Difference]: Finished difference Result 8722 states and 11408 transitions. [2018-10-24 16:08:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:08:10,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-24 16:08:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:10,159 INFO L225 Difference]: With dead ends: 8722 [2018-10-24 16:08:10,160 INFO L226 Difference]: Without dead ends: 5287 [2018-10-24 16:08:10,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2018-10-24 16:08:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 5287. [2018-10-24 16:08:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5287 states. [2018-10-24 16:08:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 6621 transitions. [2018-10-24 16:08:10,249 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 6621 transitions. Word has length 256 [2018-10-24 16:08:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:10,250 INFO L481 AbstractCegarLoop]: Abstraction has 5287 states and 6621 transitions. [2018-10-24 16:08:10,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:08:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 6621 transitions. [2018-10-24 16:08:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-24 16:08:10,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:10,257 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-24 16:08:10,257 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:10,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash 297930025, now seen corresponding path program 1 times [2018-10-24 16:08:10,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:10,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:10,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:10,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:10,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:10,555 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-24 16:08:10,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:08:10,555 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:08:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:10,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:08:12,824 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-24 16:08:16,993 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-24 16:08:17,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:08:17,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 16:08:17,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:08:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:08:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-10-24 16:08:17,017 INFO L87 Difference]: Start difference. First operand 5287 states and 6621 transitions. Second operand 6 states. [2018-10-24 16:08:24,395 WARN L179 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 491 DAG size of output: 21 [2018-10-24 16:08:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:27,890 INFO L93 Difference]: Finished difference Result 18257 states and 22937 transitions. [2018-10-24 16:08:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:08:27,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2018-10-24 16:08:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:27,944 INFO L225 Difference]: With dead ends: 18257 [2018-10-24 16:08:27,944 INFO L226 Difference]: Without dead ends: 13157 [2018-10-24 16:08:27,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2018-10-24 16:08:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13157 states. [2018-10-24 16:08:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13157 to 7372. [2018-10-24 16:08:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7372 states. [2018-10-24 16:08:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 9064 transitions. [2018-10-24 16:08:28,126 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 9064 transitions. Word has length 262 [2018-10-24 16:08:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:28,127 INFO L481 AbstractCegarLoop]: Abstraction has 7372 states and 9064 transitions. [2018-10-24 16:08:28,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:08:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 9064 transitions. [2018-10-24 16:08:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-24 16:08:28,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:28,136 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-24 16:08:28,136 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:28,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 835350734, now seen corresponding path program 1 times [2018-10-24 16:08:28,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:28,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:28,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:28,701 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-24 16:08:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:28,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:08:28,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:08:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:08:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:08:28,703 INFO L87 Difference]: Start difference. First operand 7372 states and 9064 transitions. Second operand 5 states. [2018-10-24 16:08:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:31,698 INFO L93 Difference]: Finished difference Result 19962 states and 24716 transitions. [2018-10-24 16:08:31,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:08:31,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2018-10-24 16:08:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:31,731 INFO L225 Difference]: With dead ends: 19962 [2018-10-24 16:08:31,732 INFO L226 Difference]: Without dead ends: 12777 [2018-10-24 16:08:31,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:08:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12777 states. [2018-10-24 16:08:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12777 to 12212. [2018-10-24 16:08:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12212 states. [2018-10-24 16:08:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 14421 transitions. [2018-10-24 16:08:31,947 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 14421 transitions. Word has length 272 [2018-10-24 16:08:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:31,948 INFO L481 AbstractCegarLoop]: Abstraction has 12212 states and 14421 transitions. [2018-10-24 16:08:31,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:08:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 14421 transitions. [2018-10-24 16:08:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-24 16:08:31,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:31,958 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-24 16:08:31,958 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1689117726, now seen corresponding path program 1 times [2018-10-24 16:08:31,959 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:32,278 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-24 16:08:32,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:08:32,278 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:08:32,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:32,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:08:32,433 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-24 16:08:32,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:08:32,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-24 16:08:32,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:08:32,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:08:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:32,459 INFO L87 Difference]: Start difference. First operand 12212 states and 14421 transitions. Second operand 4 states. [2018-10-24 16:08:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:34,037 INFO L93 Difference]: Finished difference Result 24235 states and 28647 transitions. [2018-10-24 16:08:34,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:08:34,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-10-24 16:08:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:34,059 INFO L225 Difference]: With dead ends: 24235 [2018-10-24 16:08:34,059 INFO L226 Difference]: Without dead ends: 12210 [2018-10-24 16:08:34,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12210 states. [2018-10-24 16:08:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12210 to 11840. [2018-10-24 16:08:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11840 states. [2018-10-24 16:08:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11840 states to 11840 states and 13567 transitions. [2018-10-24 16:08:34,228 INFO L78 Accepts]: Start accepts. Automaton has 11840 states and 13567 transitions. Word has length 283 [2018-10-24 16:08:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:34,229 INFO L481 AbstractCegarLoop]: Abstraction has 11840 states and 13567 transitions. [2018-10-24 16:08:34,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 11840 states and 13567 transitions. [2018-10-24 16:08:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-24 16:08:34,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:34,238 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-24 16:08:34,238 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:34,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1097236926, now seen corresponding path program 1 times [2018-10-24 16:08:34,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:34,725 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 16:08:34,790 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-24 16:08:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:34,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:08:34,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:08:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:08:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:34,792 INFO L87 Difference]: Start difference. First operand 11840 states and 13567 transitions. Second operand 4 states. [2018-10-24 16:08:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:36,230 INFO L93 Difference]: Finished difference Result 24623 states and 28218 transitions. [2018-10-24 16:08:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:36,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-10-24 16:08:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:36,252 INFO L225 Difference]: With dead ends: 24623 [2018-10-24 16:08:36,252 INFO L226 Difference]: Without dead ends: 12970 [2018-10-24 16:08:36,264 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-24 16:08:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2018-10-24 16:08:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12397. [2018-10-24 16:08:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12397 states. [2018-10-24 16:08:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12397 states to 12397 states and 14161 transitions. [2018-10-24 16:08:36,426 INFO L78 Accepts]: Start accepts. Automaton has 12397 states and 14161 transitions. Word has length 286 [2018-10-24 16:08:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:36,427 INFO L481 AbstractCegarLoop]: Abstraction has 12397 states and 14161 transitions. [2018-10-24 16:08:36,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12397 states and 14161 transitions. [2018-10-24 16:08:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-24 16:08:36,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:36,438 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-24 16:08:36,438 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:36,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1928928753, now seen corresponding path program 1 times [2018-10-24 16:08:36,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:36,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:36,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:36,708 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-24 16:08:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:08:36,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:08:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:08:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:36,709 INFO L87 Difference]: Start difference. First operand 12397 states and 14161 transitions. Second operand 3 states. [2018-10-24 16:08:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:38,148 INFO L93 Difference]: Finished difference Result 29972 states and 34199 transitions. [2018-10-24 16:08:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:08:38,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-10-24 16:08:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:38,173 INFO L225 Difference]: With dead ends: 29972 [2018-10-24 16:08:38,173 INFO L226 Difference]: Without dead ends: 16455 [2018-10-24 16:08:38,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2018-10-24 16:08:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 15900. [2018-10-24 16:08:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15900 states. [2018-10-24 16:08:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 17739 transitions. [2018-10-24 16:08:38,377 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 17739 transitions. Word has length 315 [2018-10-24 16:08:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:38,377 INFO L481 AbstractCegarLoop]: Abstraction has 15900 states and 17739 transitions. [2018-10-24 16:08:38,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:08:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 17739 transitions. [2018-10-24 16:08:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-24 16:08:38,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:38,392 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-24 16:08:38,393 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:38,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1132583105, now seen corresponding path program 1 times [2018-10-24 16:08:38,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:38,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:38,857 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-24 16:08:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:08:38,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:08:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:08:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:38,859 INFO L87 Difference]: Start difference. First operand 15900 states and 17739 transitions. Second operand 3 states. [2018-10-24 16:08:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:40,507 INFO L93 Difference]: Finished difference Result 31985 states and 35717 transitions. [2018-10-24 16:08:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:08:40,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-24 16:08:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:40,524 INFO L225 Difference]: With dead ends: 31985 [2018-10-24 16:08:40,524 INFO L226 Difference]: Without dead ends: 14406 [2018-10-24 16:08:40,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:08:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14406 states. [2018-10-24 16:08:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14406 to 14035. [2018-10-24 16:08:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14035 states. [2018-10-24 16:08:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14035 states to 14035 states and 15525 transitions. [2018-10-24 16:08:40,709 INFO L78 Accepts]: Start accepts. Automaton has 14035 states and 15525 transitions. Word has length 341 [2018-10-24 16:08:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:40,709 INFO L481 AbstractCegarLoop]: Abstraction has 14035 states and 15525 transitions. [2018-10-24 16:08:40,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:08:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 14035 states and 15525 transitions. [2018-10-24 16:08:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 16:08:40,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:40,722 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-24 16:08:40,722 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:40,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2048231361, now seen corresponding path program 1 times [2018-10-24 16:08:40,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:40,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:40,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:40,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:40,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:41,337 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-24 16:08:41,463 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-24 16:08:41,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:41,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:08:41,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:08:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:08:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:41,465 INFO L87 Difference]: Start difference. First operand 14035 states and 15525 transitions. Second operand 4 states. [2018-10-24 16:08:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:44,419 INFO L93 Difference]: Finished difference Result 27697 states and 30680 transitions. [2018-10-24 16:08:44,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:44,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2018-10-24 16:08:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:44,433 INFO L225 Difference]: With dead ends: 27697 [2018-10-24 16:08:44,433 INFO L226 Difference]: Without dead ends: 12909 [2018-10-24 16:08:44,445 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-24 16:08:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2018-10-24 16:08:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12722. [2018-10-24 16:08:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12722 states. [2018-10-24 16:08:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12722 states to 12722 states and 13948 transitions. [2018-10-24 16:08:44,599 INFO L78 Accepts]: Start accepts. Automaton has 12722 states and 13948 transitions. Word has length 342 [2018-10-24 16:08:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:44,599 INFO L481 AbstractCegarLoop]: Abstraction has 12722 states and 13948 transitions. [2018-10-24 16:08:44,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12722 states and 13948 transitions. [2018-10-24 16:08:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-24 16:08:44,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:44,615 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-24 16:08:44,616 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:44,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1788547456, now seen corresponding path program 1 times [2018-10-24 16:08:44,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:44,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:45,258 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-24 16:08:45,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:08:45,259 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:08:45,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:45,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:08:45,665 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 16:08:46,158 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-24 16:08:46,805 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-24 16:08:46,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:08:46,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-10-24 16:08:46,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 16:08:46,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 16:08:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:08:46,841 INFO L87 Difference]: Start difference. First operand 12722 states and 13948 transitions. Second operand 11 states. [2018-10-24 16:08:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:52,917 INFO L93 Difference]: Finished difference Result 28403 states and 31169 transitions. [2018-10-24 16:08:52,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 16:08:52,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 379 [2018-10-24 16:08:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:52,933 INFO L225 Difference]: With dead ends: 28403 [2018-10-24 16:08:52,933 INFO L226 Difference]: Without dead ends: 15868 [2018-10-24 16:08:52,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-24 16:08:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15868 states. [2018-10-24 16:08:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15868 to 12533. [2018-10-24 16:08:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12533 states. [2018-10-24 16:08:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 13607 transitions. [2018-10-24 16:08:53,105 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 13607 transitions. Word has length 379 [2018-10-24 16:08:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:53,106 INFO L481 AbstractCegarLoop]: Abstraction has 12533 states and 13607 transitions. [2018-10-24 16:08:53,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 16:08:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 13607 transitions. [2018-10-24 16:08:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-24 16:08:53,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:53,120 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-24 16:08:53,121 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -390299597, now seen corresponding path program 1 times [2018-10-24 16:08:53,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:53,639 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-24 16:08:53,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:08:53,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:08:53,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:08:53,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:08:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:08:53,645 INFO L87 Difference]: Start difference. First operand 12533 states and 13607 transitions. Second operand 4 states. [2018-10-24 16:08:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:56,245 INFO L93 Difference]: Finished difference Result 25445 states and 27637 transitions. [2018-10-24 16:08:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:56,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-10-24 16:08:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:56,259 INFO L225 Difference]: With dead ends: 25445 [2018-10-24 16:08:56,259 INFO L226 Difference]: Without dead ends: 13099 [2018-10-24 16:08:56,268 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-24 16:08:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13099 states. [2018-10-24 16:08:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13099 to 12718. [2018-10-24 16:08:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12718 states. [2018-10-24 16:08:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 13768 transitions. [2018-10-24 16:08:56,461 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 13768 transitions. Word has length 385 [2018-10-24 16:08:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:56,461 INFO L481 AbstractCegarLoop]: Abstraction has 12718 states and 13768 transitions. [2018-10-24 16:08:56,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:08:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 13768 transitions. [2018-10-24 16:08:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-24 16:08:56,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:08:56,479 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-24 16:08:56,479 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:08:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:08:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash -971100732, now seen corresponding path program 1 times [2018-10-24 16:08:56,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:08:56,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:08:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:08:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:57,232 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 16:08:57,341 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-24 16:08:57,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:08:57,341 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-24 16:08:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:08:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:08:57,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:08:57,656 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-24 16:08:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:08:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 16:08:57,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:08:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:08:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:08:57,679 INFO L87 Difference]: Start difference. First operand 12718 states and 13768 transitions. Second operand 6 states. [2018-10-24 16:08:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:08:59,830 INFO L93 Difference]: Finished difference Result 25253 states and 27350 transitions. [2018-10-24 16:08:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:08:59,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 390 [2018-10-24 16:08:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:08:59,842 INFO L225 Difference]: With dead ends: 25253 [2018-10-24 16:08:59,842 INFO L226 Difference]: Without dead ends: 12722 [2018-10-24 16:08:59,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:08:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12722 states. [2018-10-24 16:08:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12722 to 12718. [2018-10-24 16:08:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12718 states. [2018-10-24 16:08:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12718 states to 12718 states and 13762 transitions. [2018-10-24 16:08:59,978 INFO L78 Accepts]: Start accepts. Automaton has 12718 states and 13762 transitions. Word has length 390 [2018-10-24 16:08:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:08:59,979 INFO L481 AbstractCegarLoop]: Abstraction has 12718 states and 13762 transitions. [2018-10-24 16:08:59,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:08:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 12718 states and 13762 transitions. [2018-10-24 16:09:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-24 16:09:00,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:00,002 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-24 16:09:00,003 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:00,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1710354276, now seen corresponding path program 1 times [2018-10-24 16:09:00,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:00,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:00,584 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-24 16:09:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:00,585 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-24 16:09:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:00,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:00,885 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-24 16:09:00,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:00,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-24 16:09:00,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:09:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:09:00,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:09:00,909 INFO L87 Difference]: Start difference. First operand 12718 states and 13762 transitions. Second operand 5 states. [2018-10-24 16:09:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:03,259 INFO L93 Difference]: Finished difference Result 28776 states and 31132 transitions. [2018-10-24 16:09:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:09:03,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 409 [2018-10-24 16:09:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:03,276 INFO L225 Difference]: With dead ends: 28776 [2018-10-24 16:09:03,277 INFO L226 Difference]: Without dead ends: 16245 [2018-10-24 16:09:03,284 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-24 16:09:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16245 states. [2018-10-24 16:09:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16245 to 14938. [2018-10-24 16:09:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14938 states. [2018-10-24 16:09:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14938 states to 14938 states and 16091 transitions. [2018-10-24 16:09:03,428 INFO L78 Accepts]: Start accepts. Automaton has 14938 states and 16091 transitions. Word has length 409 [2018-10-24 16:09:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:03,428 INFO L481 AbstractCegarLoop]: Abstraction has 14938 states and 16091 transitions. [2018-10-24 16:09:03,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:09:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 14938 states and 16091 transitions. [2018-10-24 16:09:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-24 16:09:03,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:03,442 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-24 16:09:03,442 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:03,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash 860584526, now seen corresponding path program 1 times [2018-10-24 16:09:03,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:03,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:03,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:04,005 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-24 16:09:04,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:09:04,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:09:04,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:09:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:09:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:09:04,006 INFO L87 Difference]: Start difference. First operand 14938 states and 16091 transitions. Second operand 5 states. [2018-10-24 16:09:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:06,391 INFO L93 Difference]: Finished difference Result 38388 states and 41278 transitions. [2018-10-24 16:09:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:09:06,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 418 [2018-10-24 16:09:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:06,413 INFO L225 Difference]: With dead ends: 38388 [2018-10-24 16:09:06,413 INFO L226 Difference]: Without dead ends: 22527 [2018-10-24 16:09:06,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:09:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22527 states. [2018-10-24 16:09:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22527 to 21784. [2018-10-24 16:09:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21784 states. [2018-10-24 16:09:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21784 states to 21784 states and 23248 transitions. [2018-10-24 16:09:06,630 INFO L78 Accepts]: Start accepts. Automaton has 21784 states and 23248 transitions. Word has length 418 [2018-10-24 16:09:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:06,631 INFO L481 AbstractCegarLoop]: Abstraction has 21784 states and 23248 transitions. [2018-10-24 16:09:06,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:09:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21784 states and 23248 transitions. [2018-10-24 16:09:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-24 16:09:06,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:06,639 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-24 16:09:06,639 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:06,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1078402377, now seen corresponding path program 1 times [2018-10-24 16:09:06,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:06,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:07,722 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-24 16:09:07,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:07,723 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-24 16:09:07,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:07,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:09,126 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-24 16:09:09,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:09,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-10-24 16:09:09,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:09:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:09:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:09:09,170 INFO L87 Difference]: Start difference. First operand 21784 states and 23248 transitions. Second operand 12 states. [2018-10-24 16:09:09,637 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-24 16:09:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:20,766 INFO L93 Difference]: Finished difference Result 48267 states and 51396 transitions. [2018-10-24 16:09:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 16:09:20,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 421 [2018-10-24 16:09:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:20,793 INFO L225 Difference]: With dead ends: 48267 [2018-10-24 16:09:20,793 INFO L226 Difference]: Without dead ends: 26670 [2018-10-24 16:09:20,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-10-24 16:09:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26670 states. [2018-10-24 16:09:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26670 to 21776. [2018-10-24 16:09:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21776 states. [2018-10-24 16:09:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21776 states to 21776 states and 23177 transitions. [2018-10-24 16:09:21,065 INFO L78 Accepts]: Start accepts. Automaton has 21776 states and 23177 transitions. Word has length 421 [2018-10-24 16:09:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:21,066 INFO L481 AbstractCegarLoop]: Abstraction has 21776 states and 23177 transitions. [2018-10-24 16:09:21,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:09:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 21776 states and 23177 transitions. [2018-10-24 16:09:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-24 16:09:21,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:21,082 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-24 16:09:21,082 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:21,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1386335279, now seen corresponding path program 1 times [2018-10-24 16:09:21,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:21,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:21,556 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-24 16:09:21,814 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-24 16:09:22,254 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-24 16:09:22,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:09:22,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:09:22,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:09:22,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:09:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:22,256 INFO L87 Difference]: Start difference. First operand 21776 states and 23177 transitions. Second operand 4 states. [2018-10-24 16:09:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:24,578 INFO L93 Difference]: Finished difference Result 43746 states and 46555 transitions. [2018-10-24 16:09:24,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:09:24,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 481 [2018-10-24 16:09:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:24,595 INFO L225 Difference]: With dead ends: 43746 [2018-10-24 16:09:24,596 INFO L226 Difference]: Without dead ends: 19552 [2018-10-24 16:09:24,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19552 states. [2018-10-24 16:09:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19552 to 17689. [2018-10-24 16:09:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17689 states. [2018-10-24 16:09:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17689 states to 17689 states and 18789 transitions. [2018-10-24 16:09:24,783 INFO L78 Accepts]: Start accepts. Automaton has 17689 states and 18789 transitions. Word has length 481 [2018-10-24 16:09:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:24,783 INFO L481 AbstractCegarLoop]: Abstraction has 17689 states and 18789 transitions. [2018-10-24 16:09:24,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:09:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17689 states and 18789 transitions. [2018-10-24 16:09:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-24 16:09:24,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:24,793 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-24 16:09:24,793 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:24,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1978485628, now seen corresponding path program 1 times [2018-10-24 16:09:24,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:24,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:25,633 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-24 16:09:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:25,634 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-24 16:09:25,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:25,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:26,260 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-24 16:09:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:26,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 16:09:26,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:09:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:09:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:09:26,283 INFO L87 Difference]: Start difference. First operand 17689 states and 18789 transitions. Second operand 9 states. [2018-10-24 16:09:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:31,910 INFO L93 Difference]: Finished difference Result 45569 states and 48351 transitions. [2018-10-24 16:09:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:09:31,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 577 [2018-10-24 16:09:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:31,936 INFO L225 Difference]: With dead ends: 45569 [2018-10-24 16:09:31,936 INFO L226 Difference]: Without dead ends: 28067 [2018-10-24 16:09:31,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:09:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28067 states. [2018-10-24 16:09:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28067 to 23062. [2018-10-24 16:09:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23062 states. [2018-10-24 16:09:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23062 states to 23062 states and 24472 transitions. [2018-10-24 16:09:32,161 INFO L78 Accepts]: Start accepts. Automaton has 23062 states and 24472 transitions. Word has length 577 [2018-10-24 16:09:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:32,162 INFO L481 AbstractCegarLoop]: Abstraction has 23062 states and 24472 transitions. [2018-10-24 16:09:32,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:09:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23062 states and 24472 transitions. [2018-10-24 16:09:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-24 16:09:32,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:32,176 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-24 16:09:32,177 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:32,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1987667603, now seen corresponding path program 1 times [2018-10-24 16:09:32,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:32,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:32,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:32,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:32,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:33,118 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-24 16:09:33,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:33,119 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-24 16:09:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:33,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:33,595 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-24 16:09:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-24 16:09:33,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:09:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:09:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:09:33,619 INFO L87 Difference]: Start difference. First operand 23062 states and 24472 transitions. Second operand 5 states. [2018-10-24 16:09:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:36,723 INFO L93 Difference]: Finished difference Result 46496 states and 49320 transitions. [2018-10-24 16:09:36,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:09:36,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 649 [2018-10-24 16:09:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:36,745 INFO L225 Difference]: With dead ends: 46496 [2018-10-24 16:09:36,745 INFO L226 Difference]: Without dead ends: 21378 [2018-10-24 16:09:36,758 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-24 16:09:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21378 states. [2018-10-24 16:09:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21378 to 16517. [2018-10-24 16:09:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16517 states. [2018-10-24 16:09:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16517 states to 16517 states and 17439 transitions. [2018-10-24 16:09:36,931 INFO L78 Accepts]: Start accepts. Automaton has 16517 states and 17439 transitions. Word has length 649 [2018-10-24 16:09:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:36,931 INFO L481 AbstractCegarLoop]: Abstraction has 16517 states and 17439 transitions. [2018-10-24 16:09:36,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:09:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 16517 states and 17439 transitions. [2018-10-24 16:09:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2018-10-24 16:09:36,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:36,944 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-24 16:09:36,944 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:36,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1344036501, now seen corresponding path program 1 times [2018-10-24 16:09:36,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:36,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:36,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:37,689 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-24 16:09:37,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:09:37,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:09:37,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:09:37,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:09:37,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:37,690 INFO L87 Difference]: Start difference. First operand 16517 states and 17439 transitions. Second operand 4 states. [2018-10-24 16:09:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:39,038 INFO L93 Difference]: Finished difference Result 31004 states and 32757 transitions. [2018-10-24 16:09:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:09:39,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 718 [2018-10-24 16:09:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:39,055 INFO L225 Difference]: With dead ends: 31004 [2018-10-24 16:09:39,055 INFO L226 Difference]: Without dead ends: 16894 [2018-10-24 16:09:39,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16894 states. [2018-10-24 16:09:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16894 to 16517. [2018-10-24 16:09:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16517 states. [2018-10-24 16:09:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16517 states to 16517 states and 17430 transitions. [2018-10-24 16:09:39,245 INFO L78 Accepts]: Start accepts. Automaton has 16517 states and 17430 transitions. Word has length 718 [2018-10-24 16:09:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:39,246 INFO L481 AbstractCegarLoop]: Abstraction has 16517 states and 17430 transitions. [2018-10-24 16:09:39,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:09:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16517 states and 17430 transitions. [2018-10-24 16:09:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-24 16:09:39,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:39,258 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-24 16:09:39,259 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:39,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:39,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1879709056, now seen corresponding path program 1 times [2018-10-24 16:09:39,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:39,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:39,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:41,460 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-24 16:09:41,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:41,461 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-24 16:09:41,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:41,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:43,212 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-24 16:09:43,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-10-24 16:09:43,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 16:09:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 16:09:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:09:43,235 INFO L87 Difference]: Start difference. First operand 16517 states and 17430 transitions. Second operand 12 states. [2018-10-24 16:09:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:48,336 INFO L93 Difference]: Finished difference Result 30749 states and 32463 transitions. [2018-10-24 16:09:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 16:09:48,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 758 [2018-10-24 16:09:48,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:48,353 INFO L225 Difference]: With dead ends: 30749 [2018-10-24 16:09:48,353 INFO L226 Difference]: Without dead ends: 16639 [2018-10-24 16:09:48,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 755 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-10-24 16:09:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16639 states. [2018-10-24 16:09:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16639 to 16331. [2018-10-24 16:09:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2018-10-24 16:09:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 17205 transitions. [2018-10-24 16:09:48,539 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 17205 transitions. Word has length 758 [2018-10-24 16:09:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:48,539 INFO L481 AbstractCegarLoop]: Abstraction has 16331 states and 17205 transitions. [2018-10-24 16:09:48,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 16:09:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 17205 transitions. [2018-10-24 16:09:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2018-10-24 16:09:48,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:48,551 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-24 16:09:48,551 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:48,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1988270976, now seen corresponding path program 1 times [2018-10-24 16:09:48,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:49,264 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-24 16:09:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:09:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:09:49,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:09:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:09:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:49,266 INFO L87 Difference]: Start difference. First operand 16331 states and 17205 transitions. Second operand 4 states. [2018-10-24 16:09:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:51,070 INFO L93 Difference]: Finished difference Result 33594 states and 35358 transitions. [2018-10-24 16:09:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:09:51,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 838 [2018-10-24 16:09:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:51,087 INFO L225 Difference]: With dead ends: 33594 [2018-10-24 16:09:51,087 INFO L226 Difference]: Without dead ends: 19670 [2018-10-24 16:09:51,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:09:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19670 states. [2018-10-24 16:09:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19670 to 16331. [2018-10-24 16:09:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2018-10-24 16:09:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 17165 transitions. [2018-10-24 16:09:51,264 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 17165 transitions. Word has length 838 [2018-10-24 16:09:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:09:51,265 INFO L481 AbstractCegarLoop]: Abstraction has 16331 states and 17165 transitions. [2018-10-24 16:09:51,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:09:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 17165 transitions. [2018-10-24 16:09:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2018-10-24 16:09:51,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:09:51,277 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-24 16:09:51,277 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:09:51,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:09:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2123115192, now seen corresponding path program 1 times [2018-10-24 16:09:51,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:09:51,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:09:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:51,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:09:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:52,058 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:09:52,515 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-24 16:09:52,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:09:52,516 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-24 16:09:52,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:09:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:09:52,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:09:54,352 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-24 16:09:54,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:09:54,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-10-24 16:09:54,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:09:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:09:54,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:09:54,389 INFO L87 Difference]: Start difference. First operand 16331 states and 17165 transitions. Second operand 8 states. [2018-10-24 16:09:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:09:59,771 INFO L93 Difference]: Finished difference Result 40447 states and 42542 transitions. [2018-10-24 16:09:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:09:59,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 852 [2018-10-24 16:09:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:09:59,793 INFO L225 Difference]: With dead ends: 40447 [2018-10-24 16:09:59,794 INFO L226 Difference]: Without dead ends: 26151 [2018-10-24 16:09:59,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:09:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26151 states. [2018-10-24 16:10:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26151 to 14657. [2018-10-24 16:10:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14657 states. [2018-10-24 16:10:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14657 states to 14657 states and 15339 transitions. [2018-10-24 16:10:00,026 INFO L78 Accepts]: Start accepts. Automaton has 14657 states and 15339 transitions. Word has length 852 [2018-10-24 16:10:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:10:00,027 INFO L481 AbstractCegarLoop]: Abstraction has 14657 states and 15339 transitions. [2018-10-24 16:10:00,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:10:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 14657 states and 15339 transitions. [2018-10-24 16:10:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-10-24 16:10:00,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:10:00,041 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-24 16:10:00,041 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:10:00,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:10:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1611105690, now seen corresponding path program 1 times [2018-10-24 16:10:00,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:10:00,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:10:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:01,050 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-24 16:10:01,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:10:01,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:10:01,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:10:01,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:10:01,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:10:01,052 INFO L87 Difference]: Start difference. First operand 14657 states and 15339 transitions. Second operand 3 states. [2018-10-24 16:10:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:10:01,966 INFO L93 Difference]: Finished difference Result 26716 states and 27965 transitions. [2018-10-24 16:10:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:10:01,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 961 [2018-10-24 16:10:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:10:01,976 INFO L225 Difference]: With dead ends: 26716 [2018-10-24 16:10:01,976 INFO L226 Difference]: Without dead ends: 9638 [2018-10-24 16:10:01,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:10:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2018-10-24 16:10:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 7233. [2018-10-24 16:10:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7233 states. [2018-10-24 16:10:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 7446 transitions. [2018-10-24 16:10:02,085 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 7446 transitions. Word has length 961 [2018-10-24 16:10:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:10:02,085 INFO L481 AbstractCegarLoop]: Abstraction has 7233 states and 7446 transitions. [2018-10-24 16:10:02,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:10:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 7446 transitions. [2018-10-24 16:10:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-10-24 16:10:02,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:10:02,095 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-24 16:10:02,095 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:10:02,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:10:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash 21786734, now seen corresponding path program 1 times [2018-10-24 16:10:02,096 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:10:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:10:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:03,248 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-24 16:10:03,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:10:03,249 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-24 16:10:03,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:03,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:10:03,924 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 16:10:05,599 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-24 16:10:05,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:10:05,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-24 16:10:05,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 16:10:05,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 16:10:05,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:10:05,622 INFO L87 Difference]: Start difference. First operand 7233 states and 7446 transitions. Second operand 13 states. [2018-10-24 16:10:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:10:12,382 INFO L93 Difference]: Finished difference Result 11495 states and 11846 transitions. [2018-10-24 16:10:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 16:10:12,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1001 [2018-10-24 16:10:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:10:12,394 INFO L225 Difference]: With dead ends: 11495 [2018-10-24 16:10:12,394 INFO L226 Difference]: Without dead ends: 11308 [2018-10-24 16:10:12,397 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-24 16:10:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11308 states. [2018-10-24 16:10:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11308 to 5566. [2018-10-24 16:10:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2018-10-24 16:10:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 5724 transitions. [2018-10-24 16:10:12,482 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 5724 transitions. Word has length 1001 [2018-10-24 16:10:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:10:12,483 INFO L481 AbstractCegarLoop]: Abstraction has 5566 states and 5724 transitions. [2018-10-24 16:10:12,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 16:10:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 5724 transitions. [2018-10-24 16:10:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2018-10-24 16:10:12,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:10:12,494 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-24 16:10:12,494 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:10:12,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:10:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash -748873225, now seen corresponding path program 1 times [2018-10-24 16:10:12,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:10:12,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:10:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:12,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:13,343 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-24 16:10:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:10:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:10:13,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:10:13,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:10:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:10:13,345 INFO L87 Difference]: Start difference. First operand 5566 states and 5724 transitions. Second operand 3 states. [2018-10-24 16:10:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:10:13,990 INFO L93 Difference]: Finished difference Result 10575 states and 10878 transitions. [2018-10-24 16:10:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:10:13,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1052 [2018-10-24 16:10:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:10:13,996 INFO L225 Difference]: With dead ends: 10575 [2018-10-24 16:10:13,996 INFO L226 Difference]: Without dead ends: 5751 [2018-10-24 16:10:13,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:10:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2018-10-24 16:10:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4641. [2018-10-24 16:10:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4641 states. [2018-10-24 16:10:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 4764 transitions. [2018-10-24 16:10:14,050 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 4764 transitions. Word has length 1052 [2018-10-24 16:10:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:10:14,050 INFO L481 AbstractCegarLoop]: Abstraction has 4641 states and 4764 transitions. [2018-10-24 16:10:14,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:10:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 4764 transitions. [2018-10-24 16:10:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-24 16:10:14,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:10:14,058 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-24 16:10:14,059 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:10:14,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:10:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash 81180474, now seen corresponding path program 1 times [2018-10-24 16:10:14,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:10:14,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:10:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:10:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:15,028 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-24 16:10:15,642 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-24 16:10:15,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:10:15,642 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-24 16:10:15,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:10:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:10:15,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:10:16,127 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 16:10:18,801 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2018-10-24 16:10:19,596 WARN L179 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-24 16:10:22,298 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-24 16:10:22,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:10:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-24 16:10:22,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:10:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:10:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2018-10-24 16:10:22,321 INFO L87 Difference]: Start difference. First operand 4641 states and 4764 transitions. Second operand 10 states. [2018-10-24 16:10:23,030 WARN L179 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-24 16:11:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:11:14,224 INFO L93 Difference]: Finished difference Result 10067 states and 10335 transitions. [2018-10-24 16:11:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 16:11:14,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1066 [2018-10-24 16:11:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:11:14,230 INFO L225 Difference]: With dead ends: 10067 [2018-10-24 16:11:14,230 INFO L226 Difference]: Without dead ends: 5198 [2018-10-24 16:11:14,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1045 SyntacticMatches, 17 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=72, Invalid=165, Unknown=3, NotChecked=0, Total=240 [2018-10-24 16:11:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2018-10-24 16:11:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 3901. [2018-10-24 16:11:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2018-10-24 16:11:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 3969 transitions. [2018-10-24 16:11:14,283 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 3969 transitions. Word has length 1066 [2018-10-24 16:11:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:11:14,284 INFO L481 AbstractCegarLoop]: Abstraction has 3901 states and 3969 transitions. [2018-10-24 16:11:14,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:11:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 3969 transitions. [2018-10-24 16:11:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2018-10-24 16:11:14,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:11:14,293 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, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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-24 16:11:14,293 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:11:14,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:11:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1160873400, now seen corresponding path program 1 times [2018-10-24 16:11:14,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:11:14,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:11:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:11:14,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:11:14,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:11:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:11:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4173 backedges. 2745 proven. 116 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked. [2018-10-24 16:11:15,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:11:15,610 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:11:15,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:11:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:11:15,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:11:16,126 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2018-10-24 16:11:26,311 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-10-24 16:11:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4173 backedges. 3305 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2018-10-24 16:11:29,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:11:29,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-24 16:11:29,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:11:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:11:29,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2018-10-24 16:11:29,199 INFO L87 Difference]: Start difference. First operand 3901 states and 3969 transitions. Second operand 7 states. Received shutdown request... [2018-10-24 16:11:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:11:35,247 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 16:11:35,253 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 16:11:35,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:11:35 BoogieIcfgContainer [2018-10-24 16:11:35,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:11:35,255 INFO L168 Benchmark]: Toolchain (without parser) took 231639.70 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 16:11:35,256 INFO L168 Benchmark]: CDTParser took 0.26 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-24 16:11:35,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-24 16:11:35,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 265.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -845.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-24 16:11:35,258 INFO L168 Benchmark]: Boogie Preprocessor took 153.10 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-24 16:11:35,258 INFO L168 Benchmark]: RCFGBuilder took 4972.73 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: 185.3 MB). Peak memory consumption was 185.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:11:35,259 INFO L168 Benchmark]: TraceAbstraction took 225372.16 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 2.2 GB in the end (delta: -183.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 16:11:35,266 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.26 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 870.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 265.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -845.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.10 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 4972.73 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: 185.3 MB). Peak memory consumption was 185.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225372.16 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 2.2 GB in the end (delta: -183.1 MB). Peak memory consumption was 1.7 GB. 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 (3901states) and FLOYD_HOARE automaton (currently 3 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (4 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 225.2s OverallTime, 30 OverallIterations, 10 TraceHistogramMax, 159.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5751 SDtfs, 18887 SDslu, 3175 SDs, 0 SdLazy, 56812 SolverSat, 6468 SolverUnsat, 58 SolverUnknown, 0 SolverNotchecked, 133.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8328 GetRequests, 8123 SyntacticMatches, 35 SemanticMatches, 170 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 34.1s 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, 29 MinimizatonAttempts, 58231 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 23453 NumberOfCodeBlocks, 23453 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 23410 ConstructedInterpolants, 1020 QuantifiedInterpolants, 103218145 SizeOfPredicates, 27 NumberOfNonLiveVariables, 10414 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 43 InterpolantComputations, 21 PerfectInterpolantSequences, 45689/52508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown