java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/Problem01_label18_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:49:17,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:49:17,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:49:17,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:49:17,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:49:17,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:49:17,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:49:17,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:49:17,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:49:17,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:49:17,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:49:17,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:49:17,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:49:17,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:49:17,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:49:17,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:49:17,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:49:17,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:49:17,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:49:17,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:49:17,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:49:17,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:49:17,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:49:17,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:49:17,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:49:17,779 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:49:17,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:49:17,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:49:17,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:49:17,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:49:17,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:49:17,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:49:17,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:49:17,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:49:17,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:49:17,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:49:17,792 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:49:17,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:49:17,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:49:17,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:49:17,815 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:49:17,817 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:49:17,817 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:49:17,817 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:49:17,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:49:17,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:49:17,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:49:17,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:49:17,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:49:17,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:49:17,820 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:49:17,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:49:17,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:49:17,820 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:49:17,820 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:49:17,820 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:49:17,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:49:17,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:49:17,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:49:17,823 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:49:17,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:49:17,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:49:17,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:49:17,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:49:17,893 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:49:17,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-11-06 19:49:17,952 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed6bf21/9fe0951b138d48b1ac929e01e485a2cd/FLAG8895d676c [2018-11-06 19:49:18,471 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:49:18,472 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label18_true-unreach-call_false-termination.c [2018-11-06 19:49:18,491 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed6bf21/9fe0951b138d48b1ac929e01e485a2cd/FLAG8895d676c [2018-11-06 19:49:18,505 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed6bf21/9fe0951b138d48b1ac929e01e485a2cd [2018-11-06 19:49:18,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:49:18,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:49:18,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:18,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:49:18,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:49:18,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:18" (1/1) ... [2018-11-06 19:49:18,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fd93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:18, skipping insertion in model container [2018-11-06 19:49:18,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:18" (1/1) ... [2018-11-06 19:49:18,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:49:18,602 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:49:19,123 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:19,128 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:49:19,232 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:49:19,251 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:49:19,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19 WrapperNode [2018-11-06 19:49:19,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:49:19,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:19,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:49:19,253 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:49:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:49:19,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:49:19,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:49:19,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:49:19,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... [2018-11-06 19:49:19,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:49:19,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:49:19,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:49:19,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:49:19,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:49:19,611 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:49:19,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:49:19,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:49:23,176 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:49:23,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:23 BoogieIcfgContainer [2018-11-06 19:49:23,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:49:23,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:49:23,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:49:23,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:49:23,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:18" (1/3) ... [2018-11-06 19:49:23,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19023063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:23, skipping insertion in model container [2018-11-06 19:49:23,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:19" (2/3) ... [2018-11-06 19:49:23,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19023063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:23, skipping insertion in model container [2018-11-06 19:49:23,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:23" (3/3) ... [2018-11-06 19:49:23,186 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label18_true-unreach-call_false-termination.c [2018-11-06 19:49:23,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:49:23,207 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:49:23,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:49:23,262 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:49:23,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:49:23,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:49:23,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:49:23,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:49:23,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:49:23,264 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:49:23,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:49:23,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:49:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:49:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-06 19:49:23,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:23,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:23,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:23,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 816741823, now seen corresponding path program 1 times [2018-11-06 19:49:23,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:23,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:23,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:23,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:23,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:23,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:23,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:23,964 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-11-06 19:49:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:26,629 INFO L93 Difference]: Finished difference Result 691 states and 1207 transitions. [2018-11-06 19:49:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:26,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-06 19:49:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:26,650 INFO L225 Difference]: With dead ends: 691 [2018-11-06 19:49:26,651 INFO L226 Difference]: Without dead ends: 485 [2018-11-06 19:49:26,655 INFO L604 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-11-06 19:49:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-11-06 19:49:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 328. [2018-11-06 19:49:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-06 19:49:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-11-06 19:49:26,720 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 101 [2018-11-06 19:49:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:26,721 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-11-06 19:49:26,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-11-06 19:49:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-06 19:49:26,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:26,726 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:26,726 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:26,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash 79214284, now seen corresponding path program 1 times [2018-11-06 19:49:26,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:26,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:49:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:26,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:26,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:26,871 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 4 states. [2018-11-06 19:49:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:28,211 INFO L93 Difference]: Finished difference Result 1182 states and 1980 transitions. [2018-11-06 19:49:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:28,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-06 19:49:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:28,218 INFO L225 Difference]: With dead ends: 1182 [2018-11-06 19:49:28,219 INFO L226 Difference]: Without dead ends: 856 [2018-11-06 19:49:28,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-06 19:49:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-06 19:49:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-06 19:49:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1303 transitions. [2018-11-06 19:49:28,270 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1303 transitions. Word has length 108 [2018-11-06 19:49:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:28,272 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1303 transitions. [2018-11-06 19:49:28,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1303 transitions. [2018-11-06 19:49:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-06 19:49:28,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:28,284 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:28,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:28,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678827, now seen corresponding path program 1 times [2018-11-06 19:49:28,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:28,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:28,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:49:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:28,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:28,526 INFO L87 Difference]: Start difference. First operand 856 states and 1303 transitions. Second operand 3 states. [2018-11-06 19:49:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:31,332 INFO L93 Difference]: Finished difference Result 2364 states and 3579 transitions. [2018-11-06 19:49:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:31,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-06 19:49:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:31,342 INFO L225 Difference]: With dead ends: 2364 [2018-11-06 19:49:31,343 INFO L226 Difference]: Without dead ends: 1510 [2018-11-06 19:49:31,344 INFO L604 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-11-06 19:49:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-11-06 19:49:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2018-11-06 19:49:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2018-11-06 19:49:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2086 transitions. [2018-11-06 19:49:31,382 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2086 transitions. Word has length 109 [2018-11-06 19:49:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:31,383 INFO L480 AbstractCegarLoop]: Abstraction has 1510 states and 2086 transitions. [2018-11-06 19:49:31,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2086 transitions. [2018-11-06 19:49:31,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-06 19:49:31,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:31,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:31,389 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:31,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2116639143, now seen corresponding path program 1 times [2018-11-06 19:49:31,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:31,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:31,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:49:31,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:31,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:31,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:31,511 INFO L87 Difference]: Start difference. First operand 1510 states and 2086 transitions. Second operand 3 states. [2018-11-06 19:49:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:32,462 INFO L93 Difference]: Finished difference Result 3546 states and 4969 transitions. [2018-11-06 19:49:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:32,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-06 19:49:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:32,474 INFO L225 Difference]: With dead ends: 3546 [2018-11-06 19:49:32,474 INFO L226 Difference]: Without dead ends: 2038 [2018-11-06 19:49:32,476 INFO L604 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-11-06 19:49:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2018-11-06 19:49:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2018-11-06 19:49:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2018-11-06 19:49:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2807 transitions. [2018-11-06 19:49:32,516 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2807 transitions. Word has length 126 [2018-11-06 19:49:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:32,516 INFO L480 AbstractCegarLoop]: Abstraction has 2038 states and 2807 transitions. [2018-11-06 19:49:32,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2807 transitions. [2018-11-06 19:49:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-06 19:49:32,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:32,521 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:32,522 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:32,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 972661155, now seen corresponding path program 1 times [2018-11-06 19:49:32,522 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-06 19:49:32,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:32,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:32,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:32,658 INFO L87 Difference]: Start difference. First operand 2038 states and 2807 transitions. Second operand 3 states. [2018-11-06 19:49:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:33,296 INFO L93 Difference]: Finished difference Result 5526 states and 7563 transitions. [2018-11-06 19:49:33,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:33,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-06 19:49:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:33,312 INFO L225 Difference]: With dead ends: 5526 [2018-11-06 19:49:33,312 INFO L226 Difference]: Without dead ends: 3490 [2018-11-06 19:49:33,316 INFO L604 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-11-06 19:49:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-11-06 19:49:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3490. [2018-11-06 19:49:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-11-06 19:49:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4530 transitions. [2018-11-06 19:49:33,377 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4530 transitions. Word has length 138 [2018-11-06 19:49:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:33,377 INFO L480 AbstractCegarLoop]: Abstraction has 3490 states and 4530 transitions. [2018-11-06 19:49:33,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4530 transitions. [2018-11-06 19:49:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-06 19:49:33,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:33,384 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:33,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:33,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -686511857, now seen corresponding path program 1 times [2018-11-06 19:49:33,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:33,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:33,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:33,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:33,618 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:49:33,856 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 19:49:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-06 19:49:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:33,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:33,884 INFO L87 Difference]: Start difference. First operand 3490 states and 4530 transitions. Second operand 4 states. [2018-11-06 19:49:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:34,861 INFO L93 Difference]: Finished difference Result 7434 states and 9567 transitions. [2018-11-06 19:49:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:34,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-11-06 19:49:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:34,876 INFO L225 Difference]: With dead ends: 7434 [2018-11-06 19:49:34,876 INFO L226 Difference]: Without dead ends: 3946 [2018-11-06 19:49:34,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:49:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2018-11-06 19:49:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3754. [2018-11-06 19:49:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-11-06 19:49:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4807 transitions. [2018-11-06 19:49:34,943 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4807 transitions. Word has length 146 [2018-11-06 19:49:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:34,943 INFO L480 AbstractCegarLoop]: Abstraction has 3754 states and 4807 transitions. [2018-11-06 19:49:34,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4807 transitions. [2018-11-06 19:49:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-06 19:49:34,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:34,950 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:34,950 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:34,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 441358951, now seen corresponding path program 1 times [2018-11-06 19:49:34,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:34,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-06 19:49:35,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:35,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:35,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:35,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:35,189 INFO L87 Difference]: Start difference. First operand 3754 states and 4807 transitions. Second operand 4 states. [2018-11-06 19:49:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:36,699 INFO L93 Difference]: Finished difference Result 7506 states and 9669 transitions. [2018-11-06 19:49:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:49:36,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-06 19:49:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:36,713 INFO L225 Difference]: With dead ends: 7506 [2018-11-06 19:49:36,713 INFO L226 Difference]: Without dead ends: 3886 [2018-11-06 19:49:36,719 INFO L604 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-11-06 19:49:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2018-11-06 19:49:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2018-11-06 19:49:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2018-11-06 19:49:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 4907 transitions. [2018-11-06 19:49:36,796 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 4907 transitions. Word has length 151 [2018-11-06 19:49:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:36,796 INFO L480 AbstractCegarLoop]: Abstraction has 3886 states and 4907 transitions. [2018-11-06 19:49:36,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 4907 transitions. [2018-11-06 19:49:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-06 19:49:36,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:36,803 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:36,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:36,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -432779357, now seen corresponding path program 1 times [2018-11-06 19:49:36,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:36,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:36,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-06 19:49:36,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:36,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:49:36,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:36,944 INFO L87 Difference]: Start difference. First operand 3886 states and 4907 transitions. Second operand 3 states. [2018-11-06 19:49:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:37,521 INFO L93 Difference]: Finished difference Result 7638 states and 9674 transitions. [2018-11-06 19:49:37,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:37,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-06 19:49:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:37,531 INFO L225 Difference]: With dead ends: 7638 [2018-11-06 19:49:37,531 INFO L226 Difference]: Without dead ends: 3214 [2018-11-06 19:49:37,535 INFO L604 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-11-06 19:49:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2018-11-06 19:49:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3214. [2018-11-06 19:49:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-11-06 19:49:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 3648 transitions. [2018-11-06 19:49:37,581 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 3648 transitions. Word has length 154 [2018-11-06 19:49:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:37,581 INFO L480 AbstractCegarLoop]: Abstraction has 3214 states and 3648 transitions. [2018-11-06 19:49:37,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 3648 transitions. [2018-11-06 19:49:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-06 19:49:37,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:37,587 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:37,587 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:37,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1213086856, now seen corresponding path program 1 times [2018-11-06 19:49:37,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-06 19:49:37,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:37,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:49:37,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:49:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:49:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:49:37,710 INFO L87 Difference]: Start difference. First operand 3214 states and 3648 transitions. Second operand 3 states. [2018-11-06 19:49:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:39,002 INFO L93 Difference]: Finished difference Result 6294 states and 7159 transitions. [2018-11-06 19:49:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:39,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-06 19:49:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:39,011 INFO L225 Difference]: With dead ends: 6294 [2018-11-06 19:49:39,011 INFO L226 Difference]: Without dead ends: 2944 [2018-11-06 19:49:39,015 INFO L604 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-11-06 19:49:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-11-06 19:49:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2680. [2018-11-06 19:49:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2018-11-06 19:49:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3027 transitions. [2018-11-06 19:49:39,050 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3027 transitions. Word has length 168 [2018-11-06 19:49:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:39,051 INFO L480 AbstractCegarLoop]: Abstraction has 2680 states and 3027 transitions. [2018-11-06 19:49:39,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:49:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3027 transitions. [2018-11-06 19:49:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-06 19:49:39,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:39,057 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:49:39,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:39,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2093448885, now seen corresponding path program 1 times [2018-11-06 19:49:39,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:39,407 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 19:49:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-06 19:49:39,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:39,534 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:49:39,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:39,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 19:49:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 19:49:39,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 19:49:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 19:49:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 19:49:39,855 INFO L87 Difference]: Start difference. First operand 2680 states and 3027 transitions. Second operand 8 states. [2018-11-06 19:49:40,033 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 19:49:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:43,764 INFO L93 Difference]: Finished difference Result 6684 states and 7545 transitions. [2018-11-06 19:49:43,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:49:43,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2018-11-06 19:49:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:43,785 INFO L225 Difference]: With dead ends: 6684 [2018-11-06 19:49:43,785 INFO L226 Difference]: Without dead ends: 3338 [2018-11-06 19:49:43,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:49:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-06 19:49:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3194. [2018-11-06 19:49:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-11-06 19:49:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3459 transitions. [2018-11-06 19:49:43,842 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3459 transitions. Word has length 198 [2018-11-06 19:49:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:43,843 INFO L480 AbstractCegarLoop]: Abstraction has 3194 states and 3459 transitions. [2018-11-06 19:49:43,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 19:49:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3459 transitions. [2018-11-06 19:49:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-06 19:49:43,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:43,851 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-11-06 19:49:43,851 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:43,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1875667848, now seen corresponding path program 1 times [2018-11-06 19:49:43,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:43,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:44,227 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 19:49:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-06 19:49:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:44,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:49:44,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:49:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:49:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:44,343 INFO L87 Difference]: Start difference. First operand 3194 states and 3459 transitions. Second operand 6 states. [2018-11-06 19:49:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:45,395 INFO L93 Difference]: Finished difference Result 6659 states and 7221 transitions. [2018-11-06 19:49:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:49:45,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2018-11-06 19:49:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:45,423 INFO L225 Difference]: With dead ends: 6659 [2018-11-06 19:49:45,424 INFO L226 Difference]: Without dead ends: 3599 [2018-11-06 19:49:45,427 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:49:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2018-11-06 19:49:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3194. [2018-11-06 19:49:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2018-11-06 19:49:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 3440 transitions. [2018-11-06 19:49:45,487 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 3440 transitions. Word has length 255 [2018-11-06 19:49:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:45,488 INFO L480 AbstractCegarLoop]: Abstraction has 3194 states and 3440 transitions. [2018-11-06 19:49:45,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:49:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 3440 transitions. [2018-11-06 19:49:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-06 19:49:45,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:45,496 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:49:45,496 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:45,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1578803217, now seen corresponding path program 1 times [2018-11-06 19:49:45,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:45,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:45,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:46,221 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-06 19:49:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-06 19:49:47,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:49:47,070 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:49:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:47,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:49:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:49:47,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:49:47,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-11-06 19:49:47,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 19:49:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 19:49:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-11-06 19:49:47,316 INFO L87 Difference]: Start difference. First operand 3194 states and 3440 transitions. Second operand 14 states. [2018-11-06 19:49:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:50,269 INFO L93 Difference]: Finished difference Result 6311 states and 6812 transitions. [2018-11-06 19:49:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:49:50,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 277 [2018-11-06 19:49:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:50,290 INFO L225 Difference]: With dead ends: 6311 [2018-11-06 19:49:50,290 INFO L226 Difference]: Without dead ends: 3251 [2018-11-06 19:49:50,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-11-06 19:49:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2018-11-06 19:49:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 3111. [2018-11-06 19:49:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2018-11-06 19:49:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3339 transitions. [2018-11-06 19:49:50,344 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3339 transitions. Word has length 277 [2018-11-06 19:49:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:50,344 INFO L480 AbstractCegarLoop]: Abstraction has 3111 states and 3339 transitions. [2018-11-06 19:49:50,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 19:49:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3339 transitions. [2018-11-06 19:49:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-06 19:49:50,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:49:50,351 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:49:50,352 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:49:50,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:49:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 473686453, now seen corresponding path program 1 times [2018-11-06 19:49:50,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:49:50,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:49:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:49:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:49:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:49:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:49:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:49:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:49:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:49:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:49:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:49:50,758 INFO L87 Difference]: Start difference. First operand 3111 states and 3339 transitions. Second operand 4 states. [2018-11-06 19:49:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:49:51,304 INFO L93 Difference]: Finished difference Result 5683 states and 6130 transitions. [2018-11-06 19:49:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:49:51,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-11-06 19:49:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:49:51,305 INFO L225 Difference]: With dead ends: 5683 [2018-11-06 19:49:51,305 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:49:51,309 INFO L604 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-11-06 19:49:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:49:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:49:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:49:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:49:51,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2018-11-06 19:49:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:49:51,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:49:51,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:49:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:49:51,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:49:51,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:49:51,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:51,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 19:49:53,044 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-06 19:49:53,369 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-06 19:49:53,372 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:49:53,372 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:49:53,372 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:49:53,373 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,374 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:49:53,375 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,376 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:49:53,377 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:49:53,378 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:49:53,378 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:49:53,378 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1))) (let ((.cse7 (= ~a20~0 1)) (.cse3 (= ~a16~0 5)) (.cse4 (<= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 6)) (.cse10 (<= ~a21~0 0)) (.cse5 (= ~a16~0 4)) (.cse6 (= ~a17~0 1)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse6 .cse0 .cse2 .cse3) (and .cse0 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse5 .cse2) (and .cse9 .cse2 .cse7) (and .cse9 .cse10 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse9 .cse4 .cse2 .cse3) (and .cse4 .cse11 .cse6 .cse0 .cse2 .cse8) (and .cse4 .cse11 .cse0 .cse1 .cse2 .cse8) (and .cse9 .cse10 .cse5 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse6 .cse0 (<= ~a20~0 0))))) [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:49:53,379 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:49:53,380 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:49:53,381 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,382 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:49:53,383 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:49:53,384 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a7~0 1))) (let ((.cse7 (= ~a20~0 1)) (.cse3 (= ~a16~0 5)) (.cse4 (<= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 6)) (.cse10 (<= ~a21~0 0)) (.cse5 (= ~a16~0 4)) (.cse6 (= ~a17~0 1)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse6 .cse0 .cse2 .cse3) (and .cse0 .cse6 .cse2 .cse7 .cse8) (and .cse9 .cse5 .cse2) (and .cse9 .cse2 .cse7) (and .cse9 .cse10 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse9 .cse4 .cse2 .cse3) (and .cse4 .cse11 .cse6 .cse0 .cse2 .cse8) (and .cse4 .cse11 .cse0 .cse1 .cse2 .cse8) (and .cse9 .cse10 .cse5 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) (= ~a8~0 13) .cse6 .cse0 (<= ~a20~0 0))))) [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:49:53,385 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,386 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:49:53,387 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,388 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:49:53,389 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,390 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:49:53,391 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,392 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:49:53,393 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:49:53,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:49:53 BoogieIcfgContainer [2018-11-06 19:49:53,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:49:53,422 INFO L168 Benchmark]: Toolchain (without parser) took 34906.81 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -890.1 MB). Peak memory consumption was 303.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,423 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:49:53,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.56 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,425 INFO L168 Benchmark]: Boogie Preprocessor took 90.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,426 INFO L168 Benchmark]: RCFGBuilder took 3639.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,427 INFO L168 Benchmark]: TraceAbstraction took 30242.51 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 449.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -230.1 MB). Peak memory consumption was 219.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:49:53,432 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.56 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 191.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.6 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3639.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30242.51 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 449.3 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -230.1 MB). Peak memory consumption was 219.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((a12 == 8 && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || ((((15 <= a8 && a16 == 4) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((15 <= a8 && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((((a12 == 8 && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a7 == 1 && a16 == 4) && a21 == 1)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || (((a7 == 1 && a21 <= 0) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((a7 == 1 && 15 <= a8) && a21 == 1) && a16 == 5)) || (((((15 <= a8 && !(a7 == 1)) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((((15 <= a8 && !(a7 == 1)) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 30.1s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1789 SDtfs, 4045 SDslu, 837 SDs, 0 SdLazy, 9257 SolverSat, 1540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 494 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3886occurred in iteration=7, 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: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 74 NumberOfFragments, 425 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4790 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2695 NumberOfCodeBlocks, 2695 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1821835 SizeOfPredicates, 2 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 2352/2384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...