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/Problem14_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:23:55,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:23:55,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:23:55,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:23:55,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:23:55,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:23:55,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:23:55,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:23:55,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:23:55,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:23:55,416 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:23:55,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:23:55,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:23:55,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:23:55,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:23:55,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:23:55,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:23:55,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:23:55,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:23:55,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:23:55,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:23:55,431 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:23:55,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:23:55,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:23:55,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:23:55,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:23:55,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:23:55,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:23:55,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:23:55,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:23:55,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:23:55,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:23:55,440 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:23:55,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:23:55,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:23:55,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:23:55,442 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 21:23:55,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:23:55,457 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:23:55,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:23:55,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:23:55,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:23:55,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:23:55,460 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:23:55,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:23:55,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:23:55,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:23:55,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:23:55,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:23:55,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:23:55,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:23:55,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:23:55,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:23:55,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:23:55,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:23:55,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:23:55,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:23:55,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:23:55,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:23:55,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:23:55,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:23:55,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:23:55,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:23:55,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:23:55,469 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:23:55,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:23:55,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:23:55,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:23:55,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:23:55,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:23:55,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label00_true-unreach-call_false-termination.c [2018-11-06 21:23:55,640 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e47b43d7/8e37ec7d19ed4a529cf9754acf8771e5/FLAGc2cd8f3d8 [2018-11-06 21:23:56,290 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:23:56,290 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label00_true-unreach-call_false-termination.c [2018-11-06 21:23:56,310 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e47b43d7/8e37ec7d19ed4a529cf9754acf8771e5/FLAGc2cd8f3d8 [2018-11-06 21:23:56,332 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e47b43d7/8e37ec7d19ed4a529cf9754acf8771e5 [2018-11-06 21:23:56,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:23:56,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:23:56,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:23:56,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:23:56,356 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:23:56,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:23:56" (1/1) ... [2018-11-06 21:23:56,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68185dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:56, skipping insertion in model container [2018-11-06 21:23:56,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:23:56" (1/1) ... [2018-11-06 21:23:56,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:23:56,444 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:23:56,965 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:23:56,970 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:23:57,108 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:23:57,128 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:23:57,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57 WrapperNode [2018-11-06 21:23:57,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:23:57,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:23:57,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:23:57,130 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:23:57,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:23:57,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:23:57,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:23:57,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:23:57,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (1/1) ... [2018-11-06 21:23:57,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:23:57,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:23:57,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:23:57,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:23:57,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (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 21:23:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:23:57,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:23:57,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:24:01,244 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:24:01,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:24:01 BoogieIcfgContainer [2018-11-06 21:24:01,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:24:01,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:24:01,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:24:01,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:24:01,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:23:56" (1/3) ... [2018-11-06 21:24:01,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7112f3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:24:01, skipping insertion in model container [2018-11-06 21:24:01,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:23:57" (2/3) ... [2018-11-06 21:24:01,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7112f3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:24:01, skipping insertion in model container [2018-11-06 21:24:01,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:24:01" (3/3) ... [2018-11-06 21:24:01,258 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label00_true-unreach-call_false-termination.c [2018-11-06 21:24:01,271 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:24:01,285 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:24:01,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:24:01,354 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:24:01,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:24:01,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:24:01,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:24:01,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:24:01,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:24:01,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:24:01,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:24:01,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:24:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-11-06 21:24:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-06 21:24:01,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:01,406 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] [2018-11-06 21:24:01,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:01,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1704727530, now seen corresponding path program 1 times [2018-11-06 21:24:01,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:01,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:01,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:01,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:01,842 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 21:24:01,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:01,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:24:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:01,870 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-11-06 21:24:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:04,679 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-11-06 21:24:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:04,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-06 21:24:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:04,707 INFO L225 Difference]: With dead ends: 854 [2018-11-06 21:24:04,707 INFO L226 Difference]: Without dead ends: 601 [2018-11-06 21:24:04,712 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 21:24:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-06 21:24:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-06 21:24:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-06 21:24:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 991 transitions. [2018-11-06 21:24:04,808 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 991 transitions. Word has length 54 [2018-11-06 21:24:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:04,809 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 991 transitions. [2018-11-06 21:24:04,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 991 transitions. [2018-11-06 21:24:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-06 21:24:04,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:04,817 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:04,817 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:04,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2068295552, now seen corresponding path program 1 times [2018-11-06 21:24:04,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:04,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:04,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:24:05,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:05,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:24:05,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:05,148 INFO L87 Difference]: Start difference. First operand 601 states and 991 transitions. Second operand 4 states. [2018-11-06 21:24:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:07,785 INFO L93 Difference]: Finished difference Result 2291 states and 3852 transitions. [2018-11-06 21:24:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:07,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-11-06 21:24:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:07,796 INFO L225 Difference]: With dead ends: 2291 [2018-11-06 21:24:07,796 INFO L226 Difference]: Without dead ends: 1692 [2018-11-06 21:24:07,799 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 21:24:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2018-11-06 21:24:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1690. [2018-11-06 21:24:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2018-11-06 21:24:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2419 transitions. [2018-11-06 21:24:07,862 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2419 transitions. Word has length 120 [2018-11-06 21:24:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:07,862 INFO L480 AbstractCegarLoop]: Abstraction has 1690 states and 2419 transitions. [2018-11-06 21:24:07,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2419 transitions. [2018-11-06 21:24:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-06 21:24:07,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:07,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:07,866 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:07,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1438870218, now seen corresponding path program 1 times [2018-11-06 21:24:07,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:24:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:08,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:08,144 INFO L87 Difference]: Start difference. First operand 1690 states and 2419 transitions. Second operand 4 states. [2018-11-06 21:24:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:11,337 INFO L93 Difference]: Finished difference Result 6061 states and 8819 transitions. [2018-11-06 21:24:11,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:11,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-06 21:24:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:11,360 INFO L225 Difference]: With dead ends: 6061 [2018-11-06 21:24:11,361 INFO L226 Difference]: Without dead ends: 4373 [2018-11-06 21:24:11,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2018-11-06 21:24:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2018-11-06 21:24:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2018-11-06 21:24:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5867 transitions. [2018-11-06 21:24:11,449 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 5867 transitions. Word has length 124 [2018-11-06 21:24:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:11,450 INFO L480 AbstractCegarLoop]: Abstraction has 4373 states and 5867 transitions. [2018-11-06 21:24:11,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 5867 transitions. [2018-11-06 21:24:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-06 21:24:11,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:11,473 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:24:11,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:11,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash 283943565, now seen corresponding path program 1 times [2018-11-06 21:24:11,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 21:24:12,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:12,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:24:12,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:24:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:24:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:24:12,078 INFO L87 Difference]: Start difference. First operand 4373 states and 5867 transitions. Second operand 7 states. [2018-11-06 21:24:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:16,780 INFO L93 Difference]: Finished difference Result 8995 states and 12078 transitions. [2018-11-06 21:24:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:24:16,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 354 [2018-11-06 21:24:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:16,805 INFO L225 Difference]: With dead ends: 8995 [2018-11-06 21:24:16,805 INFO L226 Difference]: Without dead ends: 4010 [2018-11-06 21:24:16,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:24:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2018-11-06 21:24:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 3831. [2018-11-06 21:24:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3831 states. [2018-11-06 21:24:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 4515 transitions. [2018-11-06 21:24:16,889 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 4515 transitions. Word has length 354 [2018-11-06 21:24:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:16,889 INFO L480 AbstractCegarLoop]: Abstraction has 3831 states and 4515 transitions. [2018-11-06 21:24:16,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:24:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 4515 transitions. [2018-11-06 21:24:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-11-06 21:24:16,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:16,905 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:16,905 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:16,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash 696100551, now seen corresponding path program 1 times [2018-11-06 21:24:16,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:16,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:16,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:16,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:17,266 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:24:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-06 21:24:17,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:17,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:24:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:24:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:24:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:24:17,715 INFO L87 Difference]: Start difference. First operand 3831 states and 4515 transitions. Second operand 6 states. [2018-11-06 21:24:19,526 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-06 21:24:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:22,112 INFO L93 Difference]: Finished difference Result 7361 states and 8722 transitions. [2018-11-06 21:24:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:22,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 510 [2018-11-06 21:24:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:22,128 INFO L225 Difference]: With dead ends: 7361 [2018-11-06 21:24:22,128 INFO L226 Difference]: Without dead ends: 3890 [2018-11-06 21:24:22,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:24:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2018-11-06 21:24:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3831. [2018-11-06 21:24:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3831 states. [2018-11-06 21:24:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 4512 transitions. [2018-11-06 21:24:22,198 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 4512 transitions. Word has length 510 [2018-11-06 21:24:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:22,198 INFO L480 AbstractCegarLoop]: Abstraction has 3831 states and 4512 transitions. [2018-11-06 21:24:22,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:24:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 4512 transitions. [2018-11-06 21:24:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-11-06 21:24:22,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:22,221 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:24:22,221 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:22,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:22,222 INFO L82 PathProgramCache]: Analyzing trace with hash 377275091, now seen corresponding path program 1 times [2018-11-06 21:24:22,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:22,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:22,953 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-06 21:24:23,296 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 21:24:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 635 proven. 46 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-06 21:24:23,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:24:23,940 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 21:24:23,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:24,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:24:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 461 proven. 132 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-06 21:24:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:24:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:24:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:24:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:24:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:24:24,819 INFO L87 Difference]: Start difference. First operand 3831 states and 4512 transitions. Second operand 10 states. [2018-11-06 21:24:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:29,760 INFO L93 Difference]: Finished difference Result 10217 states and 12256 transitions. [2018-11-06 21:24:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:24:29,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 617 [2018-11-06 21:24:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:29,789 INFO L225 Difference]: With dead ends: 10217 [2018-11-06 21:24:29,789 INFO L226 Difference]: Without dead ends: 6386 [2018-11-06 21:24:29,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 614 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:24:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6386 states. [2018-11-06 21:24:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6386 to 5079. [2018-11-06 21:24:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2018-11-06 21:24:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 6129 transitions. [2018-11-06 21:24:29,924 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 6129 transitions. Word has length 617 [2018-11-06 21:24:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:29,925 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 6129 transitions. [2018-11-06 21:24:29,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:24:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 6129 transitions. [2018-11-06 21:24:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2018-11-06 21:24:29,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:29,962 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:24:29,963 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:29,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash 252617122, now seen corresponding path program 1 times [2018-11-06 21:24:29,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:29,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:29,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:30,564 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-06 21:24:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 1278 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-11-06 21:24:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:30,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:30,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:30,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:30,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:30,861 INFO L87 Difference]: Start difference. First operand 5079 states and 6129 transitions. Second operand 4 states. [2018-11-06 21:24:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:32,060 INFO L93 Difference]: Finished difference Result 11728 states and 14271 transitions. [2018-11-06 21:24:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:32,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 799 [2018-11-06 21:24:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:32,086 INFO L225 Difference]: With dead ends: 11728 [2018-11-06 21:24:32,086 INFO L226 Difference]: Without dead ends: 6830 [2018-11-06 21:24:32,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2018-11-06 21:24:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 6686. [2018-11-06 21:24:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6686 states. [2018-11-06 21:24:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 7661 transitions. [2018-11-06 21:24:32,209 INFO L78 Accepts]: Start accepts. Automaton has 6686 states and 7661 transitions. Word has length 799 [2018-11-06 21:24:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:32,210 INFO L480 AbstractCegarLoop]: Abstraction has 6686 states and 7661 transitions. [2018-11-06 21:24:32,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6686 states and 7661 transitions. [2018-11-06 21:24:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-11-06 21:24:32,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:32,227 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:24:32,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:32,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2100798433, now seen corresponding path program 1 times [2018-11-06 21:24:32,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:32,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1916 proven. 156 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-11-06 21:24:33,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:24:33,651 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 21:24:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:33,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:24:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1065 proven. 0 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-06 21:24:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:24:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:24:34,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:24:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:24:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:24:34,443 INFO L87 Difference]: Start difference. First operand 6686 states and 7661 transitions. Second operand 6 states. [2018-11-06 21:24:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:36,488 INFO L93 Difference]: Finished difference Result 17900 states and 21189 transitions. [2018-11-06 21:24:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:24:36,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 939 [2018-11-06 21:24:36,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:36,517 INFO L225 Difference]: With dead ends: 17900 [2018-11-06 21:24:36,517 INFO L226 Difference]: Without dead ends: 11395 [2018-11-06 21:24:36,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 940 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:24:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11395 states. [2018-11-06 21:24:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11395 to 8764. [2018-11-06 21:24:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8764 states. [2018-11-06 21:24:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8764 states to 8764 states and 9853 transitions. [2018-11-06 21:24:36,674 INFO L78 Accepts]: Start accepts. Automaton has 8764 states and 9853 transitions. Word has length 939 [2018-11-06 21:24:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:36,675 INFO L480 AbstractCegarLoop]: Abstraction has 8764 states and 9853 transitions. [2018-11-06 21:24:36,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:24:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8764 states and 9853 transitions. [2018-11-06 21:24:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 999 [2018-11-06 21:24:36,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:36,696 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:36,697 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:36,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 596645417, now seen corresponding path program 1 times [2018-11-06 21:24:36,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:36,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3162 backedges. 1182 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-11-06 21:24:37,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:37,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:24:37,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:24:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:24:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:37,891 INFO L87 Difference]: Start difference. First operand 8764 states and 9853 transitions. Second operand 5 states. [2018-11-06 21:24:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:39,548 INFO L93 Difference]: Finished difference Result 21302 states and 24012 transitions. [2018-11-06 21:24:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:39,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 998 [2018-11-06 21:24:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:39,575 INFO L225 Difference]: With dead ends: 21302 [2018-11-06 21:24:39,575 INFO L226 Difference]: Without dead ends: 6142 [2018-11-06 21:24:39,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2018-11-06 21:24:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5389. [2018-11-06 21:24:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5389 states. [2018-11-06 21:24:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 5389 states and 5577 transitions. [2018-11-06 21:24:39,680 INFO L78 Accepts]: Start accepts. Automaton has 5389 states and 5577 transitions. Word has length 998 [2018-11-06 21:24:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:39,681 INFO L480 AbstractCegarLoop]: Abstraction has 5389 states and 5577 transitions. [2018-11-06 21:24:39,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:24:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5389 states and 5577 transitions. [2018-11-06 21:24:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2018-11-06 21:24:39,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:39,700 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:24:39,700 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:39,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash 668670425, now seen corresponding path program 1 times [2018-11-06 21:24:39,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:39,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2018-11-06 21:24:41,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:41,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:24:41,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:24:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:24:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:24:41,214 INFO L87 Difference]: Start difference. First operand 5389 states and 5577 transitions. Second operand 3 states. [2018-11-06 21:24:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:42,301 INFO L93 Difference]: Finished difference Result 11313 states and 11732 transitions. [2018-11-06 21:24:42,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:24:42,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1030 [2018-11-06 21:24:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:42,315 INFO L225 Difference]: With dead ends: 11313 [2018-11-06 21:24:42,316 INFO L226 Difference]: Without dead ends: 6105 [2018-11-06 21:24:42,322 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 21:24:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2018-11-06 21:24:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5925. [2018-11-06 21:24:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5925 states. [2018-11-06 21:24:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6136 transitions. [2018-11-06 21:24:42,408 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6136 transitions. Word has length 1030 [2018-11-06 21:24:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:42,410 INFO L480 AbstractCegarLoop]: Abstraction has 5925 states and 6136 transitions. [2018-11-06 21:24:42,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:24:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6136 transitions. [2018-11-06 21:24:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-11-06 21:24:42,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:42,432 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:42,433 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:42,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1823285561, now seen corresponding path program 1 times [2018-11-06 21:24:42,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:43,256 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:24:43,497 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:24:43,685 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:24:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3447 backedges. 2239 proven. 0 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2018-11-06 21:24:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:24:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:24:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:24:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:24:44,950 INFO L87 Difference]: Start difference. First operand 5925 states and 6136 transitions. Second operand 6 states. [2018-11-06 21:24:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:46,679 INFO L93 Difference]: Finished difference Result 12924 states and 13397 transitions. [2018-11-06 21:24:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:24:46,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1094 [2018-11-06 21:24:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:46,689 INFO L225 Difference]: With dead ends: 12924 [2018-11-06 21:24:46,689 INFO L226 Difference]: Without dead ends: 4325 [2018-11-06 21:24:46,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:24:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2018-11-06 21:24:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 3947. [2018-11-06 21:24:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3947 states. [2018-11-06 21:24:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 4038 transitions. [2018-11-06 21:24:46,749 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 4038 transitions. Word has length 1094 [2018-11-06 21:24:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:46,750 INFO L480 AbstractCegarLoop]: Abstraction has 3947 states and 4038 transitions. [2018-11-06 21:24:46,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:24:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 4038 transitions. [2018-11-06 21:24:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1116 [2018-11-06 21:24:46,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:46,766 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:46,766 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:46,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1359744435, now seen corresponding path program 1 times [2018-11-06 21:24:46,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:46,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:46,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3484 backedges. 2209 proven. 0 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-06 21:24:48,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:48,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:48,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:48,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:48,480 INFO L87 Difference]: Start difference. First operand 3947 states and 4038 transitions. Second operand 4 states. [2018-11-06 21:24:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:49,384 INFO L93 Difference]: Finished difference Result 8071 states and 8259 transitions. [2018-11-06 21:24:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:49,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1115 [2018-11-06 21:24:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:49,392 INFO L225 Difference]: With dead ends: 8071 [2018-11-06 21:24:49,392 INFO L226 Difference]: Without dead ends: 4305 [2018-11-06 21:24:49,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2018-11-06 21:24:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 4126. [2018-11-06 21:24:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2018-11-06 21:24:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 4214 transitions. [2018-11-06 21:24:49,455 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 4214 transitions. Word has length 1115 [2018-11-06 21:24:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:49,456 INFO L480 AbstractCegarLoop]: Abstraction has 4126 states and 4214 transitions. [2018-11-06 21:24:49,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 4214 transitions. [2018-11-06 21:24:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2018-11-06 21:24:49,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:49,476 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:49,476 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:49,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2063801634, now seen corresponding path program 1 times [2018-11-06 21:24:49,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:49,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4190 backedges. 2820 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-11-06 21:24:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:24:50,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:24:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:24:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:50,983 INFO L87 Difference]: Start difference. First operand 4126 states and 4214 transitions. Second operand 5 states. [2018-11-06 21:24:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:52,068 INFO L93 Difference]: Finished difference Result 8789 states and 8981 transitions. [2018-11-06 21:24:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:24:52,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1211 [2018-11-06 21:24:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:52,078 INFO L225 Difference]: With dead ends: 8789 [2018-11-06 21:24:52,078 INFO L226 Difference]: Without dead ends: 4844 [2018-11-06 21:24:52,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:24:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2018-11-06 21:24:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 4305. [2018-11-06 21:24:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2018-11-06 21:24:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 4394 transitions. [2018-11-06 21:24:52,141 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 4394 transitions. Word has length 1211 [2018-11-06 21:24:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:52,142 INFO L480 AbstractCegarLoop]: Abstraction has 4305 states and 4394 transitions. [2018-11-06 21:24:52,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:24:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 4394 transitions. [2018-11-06 21:24:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1464 [2018-11-06 21:24:52,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:24:52,166 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:24:52,166 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:24:52,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:24:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1696573557, now seen corresponding path program 1 times [2018-11-06 21:24:52,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:24:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:24:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:52,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:24:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:24:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:24:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6371 backedges. 1704 proven. 0 refuted. 0 times theorem prover too weak. 4667 trivial. 0 not checked. [2018-11-06 21:24:53,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:24:53,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:24:53,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:24:53,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:24:53,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:53,958 INFO L87 Difference]: Start difference. First operand 4305 states and 4394 transitions. Second operand 4 states. [2018-11-06 21:24:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:24:54,910 INFO L93 Difference]: Finished difference Result 8247 states and 8423 transitions. [2018-11-06 21:24:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:24:54,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1463 [2018-11-06 21:24:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:24:54,912 INFO L225 Difference]: With dead ends: 8247 [2018-11-06 21:24:54,912 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:24:54,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:24:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:24:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:24:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:24:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:24:54,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1463 [2018-11-06 21:24:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:24:54,919 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:24:54,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:24:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:24:54,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:24:54,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:24:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:54,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:54,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:54,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,205 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 173 [2018-11-06 21:24:55,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:24:55,455 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 173 [2018-11-06 21:24:56,941 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 155 DAG size of output: 62 [2018-11-06 21:24:59,730 WARN L179 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 155 DAG size of output: 65 [2018-11-06 21:24:59,733 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-06 21:24:59,733 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-06 21:24:59,733 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,733 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,734 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:24:59,735 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-06 21:24:59,736 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:24:59,737 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,738 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,739 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-06 21:24:59,740 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-06 21:24:59,741 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-06 21:24:59,742 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:24:59,743 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-06 21:24:59,744 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:24:59,745 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,746 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse2 (<= ~a12~0 11)) (.cse8 (<= ~a12~0 76)) (.cse5 (= ~a21~0 6)) (.cse3 (< 0 (+ ~a12~0 43))) (.cse4 (not (= 7 ~a21~0))) (.cse10 (< 80 ~a12~0)) (.cse11 (not (= ~a21~0 10))) (.cse7 (<= ~a15~0 7)) (.cse9 (not (= ~a15~0 5))) (.cse0 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse6 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= ~a21~0 9)) .cse4 .cse1 .cse2) (and (and .cse5 .cse6) .cse7) (and .cse8 (<= 58 ~a12~0) .cse7 .cse1) (and .cse7 (and .cse4 .cse1) (<= ~a12~0 80)) (and .cse9 .cse1 .cse10) (and .cse8 (and .cse4 .cse0) (not .cse5) .cse1 .cse3 .cse11) (and (<= ~a12~0 73282) .cse4 .cse1 .cse10) (and .cse4 .cse1 .cse10 .cse11) (and .cse1 (= ~a21~0 8) (= ~a15~0 9)) (and .cse7 (and .cse9 .cse1)) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse0 .cse1 (= ~a21~0 7) .cse6))) [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-06 21:24:59,747 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-06 21:24:59,748 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-06 21:24:59,749 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-06 21:24:59,750 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse2 (<= ~a12~0 11)) (.cse8 (<= ~a12~0 76)) (.cse5 (= ~a21~0 6)) (.cse3 (< 0 (+ ~a12~0 43))) (.cse4 (not (= 7 ~a21~0))) (.cse10 (< 80 ~a12~0)) (.cse11 (not (= ~a21~0 10))) (.cse0 (= ~a15~0 8)) (.cse6 (<= (+ ~a12~0 49) 0)) (.cse7 (<= ~a15~0 7)) (.cse9 (not (= ~a15~0 5))) (.cse1 (= ~a24~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not (= ~a21~0 9)) .cse4 .cse1 .cse2) (and (and .cse5 .cse6) .cse7) (and .cse8 (<= 58 ~a12~0) .cse7 .cse1) (and .cse7 (and .cse4 .cse1) (<= ~a12~0 80)) (and .cse9 .cse1 .cse10) (and .cse8 (and .cse4 .cse0) (not .cse5) .cse1 .cse3 .cse11) (and (<= ~a12~0 73282) .cse4 .cse1 .cse10) (and .cse4 .cse1 .cse10 .cse11) (and .cse1 (= ~a21~0 8) (= ~a15~0 9)) (and .cse0 .cse1 (= ~a21~0 7) .cse6) (and .cse7 (and .cse9 .cse1)))) [2018-11-06 21:24:59,750 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,751 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-06 21:24:59,752 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,753 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-06 21:24:59,754 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:24:59,755 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:24:59,755 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:24:59,755 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-06 21:24:59,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:24:59 BoogieIcfgContainer [2018-11-06 21:24:59,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:24:59,780 INFO L168 Benchmark]: Toolchain (without parser) took 63432.41 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -850.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,781 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:24:59,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.06 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 230.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,783 INFO L168 Benchmark]: Boogie Preprocessor took 127.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,784 INFO L168 Benchmark]: RCFGBuilder took 3757.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,785 INFO L168 Benchmark]: TraceAbstraction took 58531.32 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -230.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-06 21:24:59,790 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.06 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 230.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3757.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58531.32 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.3 GB in the end (delta: -230.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || (((!(a21 == 9) && !(7 == a21)) && a24 == 1) && a12 <= 11)) || ((a21 == 6 && a12 + 49 <= 0) && a15 <= 7)) || (((a12 <= 76 && 58 <= a12) && a15 <= 7) && a24 == 1)) || ((a15 <= 7 && !(7 == a21) && a24 == 1) && a12 <= 80)) || ((!(a15 == 5) && a24 == 1) && 80 < a12)) || (((((a12 <= 76 && !(7 == a21) && a15 == 8) && !(a21 == 6)) && a24 == 1) && 0 < a12 + 43) && !(a21 == 10))) || (((a12 <= 73282 && !(7 == a21)) && a24 == 1) && 80 < a12)) || (((!(7 == a21) && a24 == 1) && 80 < a12) && !(a21 == 10))) || ((a24 == 1 && a21 == 8) && a15 == 9)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (a15 <= 7 && !(a15 == 5) && a24 == 1) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || (((!(a21 == 9) && !(7 == a21)) && a24 == 1) && a12 <= 11)) || ((a21 == 6 && a12 + 49 <= 0) && a15 <= 7)) || (((a12 <= 76 && 58 <= a12) && a15 <= 7) && a24 == 1)) || ((a15 <= 7 && !(7 == a21) && a24 == 1) && a12 <= 80)) || ((!(a15 == 5) && a24 == 1) && 80 < a12)) || (((((a12 <= 76 && !(7 == a21) && a15 == 8) && !(a21 == 6)) && a24 == 1) && 0 < a12 + 43) && !(a21 == 10))) || (((a12 <= 73282 && !(7 == a21)) && a24 == 1) && 80 < a12)) || (((!(7 == a21) && a24 == 1) && 80 < a12) && !(a21 == 10))) || ((a24 == 1 && a21 == 8) && a15 == 9)) || (a15 <= 7 && !(a15 == 5) && a24 == 1)) || ((((!(input == 5) && a15 == 8) && a24 == 1) && a21 == 7) && a12 + 49 <= 0) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 58.4s OverallTime, 14 OverallIterations, 12 TraceHistogramMax, 33.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1635 SDtfs, 7244 SDslu, 1228 SDs, 0 SdLazy, 17804 SolverSat, 2439 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1631 GetRequests, 1573 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8764occurred in iteration=8, 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: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 6351 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13769 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5056 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 11984 NumberOfCodeBlocks, 11984 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 11968 ConstructedInterpolants, 0 QuantifiedInterpolants, 24675922 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1885 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 33543/33877 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...