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/Problem15_label26_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:31:40,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:31:40,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:31:40,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:31:40,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:31:40,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:31:40,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:31:40,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:31:40,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:31:40,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:31:40,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:31:40,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:31:40,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:31:40,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:31:40,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:31:40,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:31:40,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:31:40,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:31:40,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:31:40,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:31:40,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:31:40,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:31:40,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:31:40,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:31:40,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:31:40,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:31:40,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:31:40,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:31:40,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:31:40,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:31:40,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:31:40,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:31:40,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:31:40,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:31:40,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:31:40,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:31:40,417 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:31:40,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:31:40,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:31:40,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:31:40,433 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:31:40,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:31:40,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:31:40,434 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:31:40,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:31:40,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:31:40,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:31:40,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:31:40,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:31:40,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:31:40,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:31:40,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:31:40,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:31:40,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:31:40,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:31:40,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:31:40,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:31:40,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:31:40,437 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:31:40,438 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:31:40,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:31:40,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:31:40,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:31:40,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:31:40,506 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:31:40,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label26_true-unreach-call.c [2018-11-06 21:31:40,568 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e90eedc/027b96b32d48408ab567d75fc2a9c2ca/FLAGb7145551a [2018-11-06 21:31:41,197 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:31:41,198 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label26_true-unreach-call.c [2018-11-06 21:31:41,223 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e90eedc/027b96b32d48408ab567d75fc2a9c2ca/FLAGb7145551a [2018-11-06 21:31:41,246 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e90eedc/027b96b32d48408ab567d75fc2a9c2ca [2018-11-06 21:31:41,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:31:41,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:31:41,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:31:41,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:31:41,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:31:41,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:31:41" (1/1) ... [2018-11-06 21:31:41,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d100604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:41, skipping insertion in model container [2018-11-06 21:31:41,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:31:41" (1/1) ... [2018-11-06 21:31:41,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:31:41,389 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:31:42,249 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:31:42,254 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:31:42,568 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:31:42,590 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:31:42,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42 WrapperNode [2018-11-06 21:31:42,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:31:42,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:31:42,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:31:42,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:31:42,604 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:31:42" (1/1) ... [2018-11-06 21:31:42,813 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:31:42" (1/1) ... [2018-11-06 21:31:43,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:31:43,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:31:43,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:31:43,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:31:43,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (1/1) ... [2018-11-06 21:31:43,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:31:43,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:31:43,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:31:43,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:31:43,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (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:31:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:31:43,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:31:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:31:51,548 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:31:51,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:31:51 BoogieIcfgContainer [2018-11-06 21:31:51,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:31:51,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:31:51,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:31:51,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:31:51,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:31:41" (1/3) ... [2018-11-06 21:31:51,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a5200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:31:51, skipping insertion in model container [2018-11-06 21:31:51,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:31:42" (2/3) ... [2018-11-06 21:31:51,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5a5200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:31:51, skipping insertion in model container [2018-11-06 21:31:51,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:31:51" (3/3) ... [2018-11-06 21:31:51,557 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label26_true-unreach-call.c [2018-11-06 21:31:51,568 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:31:51,578 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:31:51,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:31:51,635 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:31:51,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:31:51,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:31:51,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:31:51,637 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:31:51,637 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:31:51,637 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:31:51,637 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:31:51,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:31:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-11-06 21:31:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-06 21:31:51,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:51,681 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:31:51,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:51,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1704727530, now seen corresponding path program 1 times [2018-11-06 21:31:51,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:52,172 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:31:52,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:52,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:31:52,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:31:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:31:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:31:52,201 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-11-06 21:31:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:31:58,628 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2018-11-06 21:31:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:31:58,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-06 21:31:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:31:58,659 INFO L225 Difference]: With dead ends: 1470 [2018-11-06 21:31:58,659 INFO L226 Difference]: Without dead ends: 1038 [2018-11-06 21:31:58,665 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:31:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-11-06 21:31:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1036. [2018-11-06 21:31:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-06 21:31:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1553 transitions. [2018-11-06 21:31:58,767 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1553 transitions. Word has length 54 [2018-11-06 21:31:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:31:58,768 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1553 transitions. [2018-11-06 21:31:58,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:31:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1553 transitions. [2018-11-06 21:31:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-06 21:31:58,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:31:58,774 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:31:58,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:31:58,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:31:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1639417051, now seen corresponding path program 1 times [2018-11-06 21:31:58,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:31:58,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:31:58,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:58,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:31:58,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:31:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:31:59,203 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:31:59,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:31:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:31:59,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:31:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:31:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:31:59,207 INFO L87 Difference]: Start difference. First operand 1036 states and 1553 transitions. Second operand 4 states. [2018-11-06 21:32:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:05,494 INFO L93 Difference]: Finished difference Result 3885 states and 5906 transitions. [2018-11-06 21:32:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:05,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-11-06 21:32:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:05,513 INFO L225 Difference]: With dead ends: 3885 [2018-11-06 21:32:05,513 INFO L226 Difference]: Without dead ends: 2851 [2018-11-06 21:32:05,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:32:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-11-06 21:32:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2546. [2018-11-06 21:32:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2018-11-06 21:32:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3538 transitions. [2018-11-06 21:32:05,590 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3538 transitions. Word has length 120 [2018-11-06 21:32:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:05,591 INFO L480 AbstractCegarLoop]: Abstraction has 2546 states and 3538 transitions. [2018-11-06 21:32:05,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:32:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3538 transitions. [2018-11-06 21:32:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 21:32:05,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:05,602 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:05,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:05,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash -270165361, now seen corresponding path program 1 times [2018-11-06 21:32:05,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:05,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:05,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:05,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 21:32:06,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:32:06,123 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:32:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:06,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:32:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:32:06,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:32:06,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:32:06,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:32:06,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:32:06,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:32:06,412 INFO L87 Difference]: Start difference. First operand 2546 states and 3538 transitions. Second operand 4 states. [2018-11-06 21:32:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:12,396 INFO L93 Difference]: Finished difference Result 9960 states and 13879 transitions. [2018-11-06 21:32:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:12,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-11-06 21:32:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:12,440 INFO L225 Difference]: With dead ends: 9960 [2018-11-06 21:32:12,440 INFO L226 Difference]: Without dead ends: 7416 [2018-11-06 21:32:12,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 1 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:32:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7416 states. [2018-11-06 21:32:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7416 to 4347. [2018-11-06 21:32:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2018-11-06 21:32:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5745 transitions. [2018-11-06 21:32:12,560 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5745 transitions. Word has length 266 [2018-11-06 21:32:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:12,561 INFO L480 AbstractCegarLoop]: Abstraction has 4347 states and 5745 transitions. [2018-11-06 21:32:12,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:32:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5745 transitions. [2018-11-06 21:32:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-06 21:32:12,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:12,573 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:12,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:12,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -556516057, now seen corresponding path program 1 times [2018-11-06 21:32:12,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:12,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:12,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:12,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:13,252 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 21:32:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-06 21:32:13,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:13,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:32:13,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:32:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:32:13,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:32:13,479 INFO L87 Difference]: Start difference. First operand 4347 states and 5745 transitions. Second operand 5 states. [2018-11-06 21:32:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:17,616 INFO L93 Difference]: Finished difference Result 10494 states and 13456 transitions. [2018-11-06 21:32:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:17,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 333 [2018-11-06 21:32:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:17,649 INFO L225 Difference]: With dead ends: 10494 [2018-11-06 21:32:17,649 INFO L226 Difference]: Without dead ends: 6149 [2018-11-06 21:32:17,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:32:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6149 states. [2018-11-06 21:32:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6149 to 5848. [2018-11-06 21:32:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5848 states. [2018-11-06 21:32:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5848 states to 5848 states and 7328 transitions. [2018-11-06 21:32:17,746 INFO L78 Accepts]: Start accepts. Automaton has 5848 states and 7328 transitions. Word has length 333 [2018-11-06 21:32:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 5848 states and 7328 transitions. [2018-11-06 21:32:17,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:32:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 7328 transitions. [2018-11-06 21:32:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-11-06 21:32:17,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:17,759 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:17,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -740759847, now seen corresponding path program 1 times [2018-11-06 21:32:17,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:17,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:18,356 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:32:18,954 WARN L179 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2018-11-06 21:32:19,559 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-11-06 21:32:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 113 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:32:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:32:20,033 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:32:20,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:20,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:32:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:32:20,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:32:20,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 21:32:20,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:32:20,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:32:20,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:32:20,421 INFO L87 Difference]: Start difference. First operand 5848 states and 7328 transitions. Second operand 9 states. [2018-11-06 21:32:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:29,714 INFO L93 Difference]: Finished difference Result 13595 states and 17187 transitions. [2018-11-06 21:32:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:32:29,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 407 [2018-11-06 21:32:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:29,744 INFO L225 Difference]: With dead ends: 13595 [2018-11-06 21:32:29,745 INFO L226 Difference]: Without dead ends: 7749 [2018-11-06 21:32:29,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 410 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:32:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2018-11-06 21:32:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 7350. [2018-11-06 21:32:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-06 21:32:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 8791 transitions. [2018-11-06 21:32:29,987 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 8791 transitions. Word has length 407 [2018-11-06 21:32:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:29,992 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 8791 transitions. [2018-11-06 21:32:29,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:32:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 8791 transitions. [2018-11-06 21:32:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-06 21:32:30,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:30,004 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:32:30,004 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:30,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash -844475085, now seen corresponding path program 1 times [2018-11-06 21:32:30,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:30,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-06 21:32:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:30,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:32:30,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:32:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:32:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:32:30,383 INFO L87 Difference]: Start difference. First operand 7350 states and 8791 transitions. Second operand 4 states. [2018-11-06 21:32:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:34,249 INFO L93 Difference]: Finished difference Result 16198 states and 19538 transitions. [2018-11-06 21:32:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:34,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2018-11-06 21:32:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:34,280 INFO L225 Difference]: With dead ends: 16198 [2018-11-06 21:32:34,280 INFO L226 Difference]: Without dead ends: 8850 [2018-11-06 21:32:34,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:32:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8850 states. [2018-11-06 21:32:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8850 to 8847. [2018-11-06 21:32:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2018-11-06 21:32:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 10351 transitions. [2018-11-06 21:32:34,413 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 10351 transitions. Word has length 426 [2018-11-06 21:32:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:34,414 INFO L480 AbstractCegarLoop]: Abstraction has 8847 states and 10351 transitions. [2018-11-06 21:32:34,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:32:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 10351 transitions. [2018-11-06 21:32:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-11-06 21:32:34,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:34,430 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:34,430 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:34,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1889979832, now seen corresponding path program 1 times [2018-11-06 21:32:34,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:34,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-06 21:32:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:32:35,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:32:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:32:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:32:35,030 INFO L87 Difference]: Start difference. First operand 8847 states and 10351 transitions. Second operand 3 states. [2018-11-06 21:32:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:38,018 INFO L93 Difference]: Finished difference Result 19491 states and 23162 transitions. [2018-11-06 21:32:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:32:38,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 521 [2018-11-06 21:32:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:38,039 INFO L225 Difference]: With dead ends: 19491 [2018-11-06 21:32:38,039 INFO L226 Difference]: Without dead ends: 10646 [2018-11-06 21:32:38,048 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:32:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2018-11-06 21:32:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2018-11-06 21:32:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10646 states. [2018-11-06 21:32:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 12395 transitions. [2018-11-06 21:32:38,184 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 12395 transitions. Word has length 521 [2018-11-06 21:32:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:38,186 INFO L480 AbstractCegarLoop]: Abstraction has 10646 states and 12395 transitions. [2018-11-06 21:32:38,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:32:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 12395 transitions. [2018-11-06 21:32:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-11-06 21:32:38,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:38,211 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,211 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:38,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1840109548, now seen corresponding path program 1 times [2018-11-06 21:32:38,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:38,984 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-06 21:32:39,339 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-06 21:32:39,861 WARN L179 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-11-06 21:32:40,084 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-11-06 21:32:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-06 21:32:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:32:40,697 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:32:40,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:32:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 605 proven. 39 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-06 21:32:41,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:32:41,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 21:32:41,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:32:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:32:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:32:41,770 INFO L87 Difference]: Start difference. First operand 10646 states and 12395 transitions. Second operand 9 states. [2018-11-06 21:32:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:51,642 INFO L93 Difference]: Finished difference Result 29259 states and 33742 transitions. [2018-11-06 21:32:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:32:51,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 613 [2018-11-06 21:32:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:51,663 INFO L225 Difference]: With dead ends: 29259 [2018-11-06 21:32:51,663 INFO L226 Difference]: Without dead ends: 11191 [2018-11-06 21:32:51,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:32:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2018-11-06 21:32:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 6687. [2018-11-06 21:32:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2018-11-06 21:32:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 7120 transitions. [2018-11-06 21:32:51,782 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 7120 transitions. Word has length 613 [2018-11-06 21:32:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:51,783 INFO L480 AbstractCegarLoop]: Abstraction has 6687 states and 7120 transitions. [2018-11-06 21:32:51,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:32:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 7120 transitions. [2018-11-06 21:32:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-11-06 21:32:51,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:51,792 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,792 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:51,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1527202116, now seen corresponding path program 1 times [2018-11-06 21:32:51,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:51,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:51,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-06 21:32:52,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:32:52,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:32:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:32:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:32:52,211 INFO L87 Difference]: Start difference. First operand 6687 states and 7120 transitions. Second operand 3 states. [2018-11-06 21:32:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:53,441 INFO L93 Difference]: Finished difference Result 13370 states and 14236 transitions. [2018-11-06 21:32:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:32:53,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 655 [2018-11-06 21:32:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:53,453 INFO L225 Difference]: With dead ends: 13370 [2018-11-06 21:32:53,453 INFO L226 Difference]: Without dead ends: 6685 [2018-11-06 21:32:53,459 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:32:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6685 states. [2018-11-06 21:32:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6685 to 6685. [2018-11-06 21:32:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6685 states. [2018-11-06 21:32:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6685 states to 6685 states and 7116 transitions. [2018-11-06 21:32:53,538 INFO L78 Accepts]: Start accepts. Automaton has 6685 states and 7116 transitions. Word has length 655 [2018-11-06 21:32:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:53,539 INFO L480 AbstractCegarLoop]: Abstraction has 6685 states and 7116 transitions. [2018-11-06 21:32:53,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:32:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6685 states and 7116 transitions. [2018-11-06 21:32:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-11-06 21:32:53,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:53,550 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:53,550 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:53,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash -833299926, now seen corresponding path program 1 times [2018-11-06 21:32:53,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:53,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:53,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:53,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:53,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-06 21:32:54,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:54,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:32:54,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:32:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:32:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:32:54,722 INFO L87 Difference]: Start difference. First operand 6685 states and 7116 transitions. Second operand 4 states. [2018-11-06 21:32:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:32:56,999 INFO L93 Difference]: Finished difference Result 18479 states and 19740 transitions. [2018-11-06 21:32:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:32:57,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2018-11-06 21:32:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:32:57,013 INFO L225 Difference]: With dead ends: 18479 [2018-11-06 21:32:57,013 INFO L226 Difference]: Without dead ends: 11796 [2018-11-06 21:32:57,021 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:32:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11796 states. [2018-11-06 21:32:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11796 to 8786. [2018-11-06 21:32:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8786 states. [2018-11-06 21:32:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8786 states to 8786 states and 9334 transitions. [2018-11-06 21:32:57,137 INFO L78 Accepts]: Start accepts. Automaton has 8786 states and 9334 transitions. Word has length 690 [2018-11-06 21:32:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:32:57,138 INFO L480 AbstractCegarLoop]: Abstraction has 8786 states and 9334 transitions. [2018-11-06 21:32:57,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:32:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 8786 states and 9334 transitions. [2018-11-06 21:32:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-11-06 21:32:57,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:32:57,150 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:32:57,150 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:32:57,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:32:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1016982954, now seen corresponding path program 1 times [2018-11-06 21:32:57,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:32:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:32:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:32:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:32:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:32:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-11-06 21:32:57,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:32:57,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:32:57,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:32:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:32:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:32:57,881 INFO L87 Difference]: Start difference. First operand 8786 states and 9334 transitions. Second operand 5 states. [2018-11-06 21:33:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:01,067 INFO L93 Difference]: Finished difference Result 21483 states and 22912 transitions. [2018-11-06 21:33:01,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:33:01,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 715 [2018-11-06 21:33:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:01,081 INFO L225 Difference]: With dead ends: 21483 [2018-11-06 21:33:01,081 INFO L226 Difference]: Without dead ends: 12091 [2018-11-06 21:33:01,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12091 states. [2018-11-06 21:33:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12091 to 9680. [2018-11-06 21:33:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9680 states. [2018-11-06 21:33:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9680 states to 9680 states and 10180 transitions. [2018-11-06 21:33:01,205 INFO L78 Accepts]: Start accepts. Automaton has 9680 states and 10180 transitions. Word has length 715 [2018-11-06 21:33:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:01,206 INFO L480 AbstractCegarLoop]: Abstraction has 9680 states and 10180 transitions. [2018-11-06 21:33:01,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:33:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9680 states and 10180 transitions. [2018-11-06 21:33:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-11-06 21:33:01,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:01,217 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:33:01,217 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:01,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -264114403, now seen corresponding path program 1 times [2018-11-06 21:33:01,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:01,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-06 21:33:02,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:33:02,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:33:02,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:33:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:33:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:33:02,113 INFO L87 Difference]: Start difference. First operand 9680 states and 10180 transitions. Second operand 5 states. [2018-11-06 21:33:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:33:04,887 INFO L93 Difference]: Finished difference Result 22668 states and 23835 transitions. [2018-11-06 21:33:04,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:33:04,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 727 [2018-11-06 21:33:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:33:04,899 INFO L225 Difference]: With dead ends: 22668 [2018-11-06 21:33:04,899 INFO L226 Difference]: Without dead ends: 12990 [2018-11-06 21:33:04,907 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:33:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12990 states. [2018-11-06 21:33:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12990 to 8780. [2018-11-06 21:33:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2018-11-06 21:33:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 9196 transitions. [2018-11-06 21:33:05,024 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 9196 transitions. Word has length 727 [2018-11-06 21:33:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:33:05,024 INFO L480 AbstractCegarLoop]: Abstraction has 8780 states and 9196 transitions. [2018-11-06 21:33:05,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:33:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 9196 transitions. [2018-11-06 21:33:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-11-06 21:33:05,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:33:05,038 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:05,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:33:05,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:33:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1401872010, now seen corresponding path program 1 times [2018-11-06 21:33:05,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:33:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:33:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:33:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 52 proven. 588 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-06 21:33:06,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:33:06,695 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:33:06,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:33:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:33:06,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:33:07,208 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 17 [2018-11-06 21:33:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-11-06 21:33:07,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:33:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:33:07,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:33:07,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:33:07,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:33:07,870 INFO L87 Difference]: Start difference. First operand 8780 states and 9196 transitions. Second operand 7 states. [2018-11-06 21:34:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:27,687 INFO L93 Difference]: Finished difference Result 31708 states and 33103 transitions. [2018-11-06 21:34:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:34:27,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 780 [2018-11-06 21:34:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:27,707 INFO L225 Difference]: With dead ends: 31708 [2018-11-06 21:34:27,707 INFO L226 Difference]: Without dead ends: 22627 [2018-11-06 21:34:27,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:34:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22627 states. [2018-11-06 21:34:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22627 to 19603. [2018-11-06 21:34:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19603 states. [2018-11-06 21:34:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19603 states to 19603 states and 20405 transitions. [2018-11-06 21:34:27,917 INFO L78 Accepts]: Start accepts. Automaton has 19603 states and 20405 transitions. Word has length 780 [2018-11-06 21:34:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:27,917 INFO L480 AbstractCegarLoop]: Abstraction has 19603 states and 20405 transitions. [2018-11-06 21:34:27,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:34:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 19603 states and 20405 transitions. [2018-11-06 21:34:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2018-11-06 21:34:27,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:27,938 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:27,939 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:27,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 176957904, now seen corresponding path program 1 times [2018-11-06 21:34:27,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:27,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:28,588 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-11-06 21:34:28,821 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 3 [2018-11-06 21:34:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2018-11-06 21:34:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:34:29,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:34:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:34:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:29,269 INFO L87 Difference]: Start difference. First operand 19603 states and 20405 transitions. Second operand 4 states. [2018-11-06 21:34:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:31,813 INFO L93 Difference]: Finished difference Result 42515 states and 44249 transitions. [2018-11-06 21:34:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:34:31,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 882 [2018-11-06 21:34:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:31,840 INFO L225 Difference]: With dead ends: 42515 [2018-11-06 21:34:31,840 INFO L226 Difference]: Without dead ends: 24717 [2018-11-06 21:34:31,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:34:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24717 states. [2018-11-06 21:34:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24717 to 11780. [2018-11-06 21:34:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11780 states. [2018-11-06 21:34:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11780 states to 11780 states and 12321 transitions. [2018-11-06 21:34:32,046 INFO L78 Accepts]: Start accepts. Automaton has 11780 states and 12321 transitions. Word has length 882 [2018-11-06 21:34:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:32,047 INFO L480 AbstractCegarLoop]: Abstraction has 11780 states and 12321 transitions. [2018-11-06 21:34:32,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:34:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11780 states and 12321 transitions. [2018-11-06 21:34:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-11-06 21:34:32,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:32,064 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:32,064 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:32,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1234204536, now seen corresponding path program 1 times [2018-11-06 21:34:32,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:32,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:32,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:32,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-11-06 21:34:32,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:32,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:32,990 INFO L87 Difference]: Start difference. First operand 11780 states and 12321 transitions. Second operand 3 states. [2018-11-06 21:34:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:34,986 INFO L93 Difference]: Finished difference Result 20520 states and 21426 transitions. [2018-11-06 21:34:34,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:34,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 883 [2018-11-06 21:34:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:34,996 INFO L225 Difference]: With dead ends: 20520 [2018-11-06 21:34:34,996 INFO L226 Difference]: Without dead ends: 8742 [2018-11-06 21:34:35,003 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:34:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8742 states. [2018-11-06 21:34:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8742 to 7842. [2018-11-06 21:34:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7842 states. [2018-11-06 21:34:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7842 states to 7842 states and 8095 transitions. [2018-11-06 21:34:35,093 INFO L78 Accepts]: Start accepts. Automaton has 7842 states and 8095 transitions. Word has length 883 [2018-11-06 21:34:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:35,094 INFO L480 AbstractCegarLoop]: Abstraction has 7842 states and 8095 transitions. [2018-11-06 21:34:35,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 7842 states and 8095 transitions. [2018-11-06 21:34:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2018-11-06 21:34:35,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:34:35,106 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:34:35,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:34:35,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:34:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1533509562, now seen corresponding path program 1 times [2018-11-06 21:34:35,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:34:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:34:35,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:35,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:34:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:34:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:34:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2018-11-06 21:34:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:34:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:34:36,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:34:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:34:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:34:36,324 INFO L87 Difference]: Start difference. First operand 7842 states and 8095 transitions. Second operand 3 states. [2018-11-06 21:34:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:34:37,828 INFO L93 Difference]: Finished difference Result 14775 states and 15250 transitions. [2018-11-06 21:34:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:34:37,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 930 [2018-11-06 21:34:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:34:37,829 INFO L225 Difference]: With dead ends: 14775 [2018-11-06 21:34:37,829 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:34:37,833 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:34:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:34:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:34:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:34:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:34:37,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 930 [2018-11-06 21:34:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:34:37,834 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:34:37,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:34:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:34:37,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:34:37,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:34:37,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:37,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:37,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,453 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 348 [2018-11-06 21:34:38,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:38,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,085 WARN L179 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 348 [2018-11-06 21:34:39,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:34:39,579 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 308 [2018-11-06 21:34:44,555 WARN L179 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 333 DAG size of output: 98 [2018-11-06 21:34:47,379 WARN L179 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 333 DAG size of output: 98 [2018-11-06 21:34:51,281 WARN L179 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 294 DAG size of output: 94 [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L102(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,285 INFO L425 ceAbstractionStarter]: For program point L105(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L108(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,286 INFO L425 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,287 INFO L425 ceAbstractionStarter]: For program point L111(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2018-11-06 21:34:51,288 INFO L425 ceAbstractionStarter]: For program point L114(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,289 INFO L425 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L117(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:34:51,290 INFO L425 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L120(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,291 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L123(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2018-11-06 21:34:51,292 INFO L425 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L126(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2018-11-06 21:34:51,293 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L129(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:34:51,294 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L132(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:34:51,295 INFO L425 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L135(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,296 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L138(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,297 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L141(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,298 INFO L425 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L144(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L147(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,300 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L150(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,301 INFO L425 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L153(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L156(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-06 21:34:51,302 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L159(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,303 INFO L425 ceAbstractionStarter]: For program point L27(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,304 INFO L425 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L162(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L30(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,305 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L33(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:34:51,306 INFO L425 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L168(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L36(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,307 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L171(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,308 INFO L425 ceAbstractionStarter]: For program point L39(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L421 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse14 (+ ~a4~0 86))) (let ((.cse16 (<= .cse14 0)) (.cse17 (+ ~a0~0 98))) (let ((.cse6 (not (= 2 ~a2~0))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse15 (and .cse16 (< 0 .cse17))) (.cse12 (<= 0 (+ ~a0~0 44))) (.cse7 (+ ~a0~0 147))) (let ((.cse5 (<= .cse7 0)) (.cse2 (<= 0 (+ ~a0~0 599999))) (.cse9 (and .cse0 (or .cse15 .cse12))) (.cse13 (and .cse16 .cse6)) (.cse3 (<= .cse17 0)) (.cse4 (= ~a2~0 2)) (.cse1 (<= ~a29~0 43)) (.cse8 (not (= 4 ~a2~0)))) (or (and .cse0 (and (= ~a2~0 1) .cse1 (< 0 (+ ~a29~0 144))) .cse2) (and .cse3 (and .cse0 (<= 0 (+ ~a0~0 140)) .cse1)) (and .cse4 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse5 (= ~a2~0 3)) (and (and .cse0 .cse5) .cse2) (and .cse3 (and .cse0 .cse6 (< 0 .cse7) .cse8)) (and .cse9 (exists ((v_prenex_3 Int)) (let ((.cse10 (* 9 v_prenex_3))) (let ((.cse11 (div .cse10 10))) (and (= 0 (mod .cse10 10)) (<= ~a29~0 (+ (mod .cse11 29) 14)) (<= 0 .cse11)))))) (and .cse1 (<= 94 ~a0~0) .cse9) (and .cse0 (or (and .cse12 .cse8) (and .cse13 .cse8))) (and (<= (+ ~a0~0 61) 0) .cse13) (and .cse3 (and .cse0 (< 0 .cse14) .cse4)) (and .cse4 .cse15) (and .cse1 .cse16 .cse8)))))) [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,309 INFO L425 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L174(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L42(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L428 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:34:51,310 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L177(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L45(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2018-11-06 21:34:51,311 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L180(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L48(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,312 INFO L425 ceAbstractionStarter]: For program point L1766-1(lines 1766 1775) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L421 ceAbstractionStarter]: At program point L1766-3(lines 1766 1775) the Hoare annotation is: (let ((.cse12 (+ ~a4~0 86))) (let ((.cse5 (<= .cse12 0)) (.cse9 (not (= 2 ~a2~0)))) (let ((.cse17 (not (= 5 ~a2~0))) (.cse1 (and .cse5 .cse9))) (let ((.cse0 (<= (+ ~a4~0 42) 0)) (.cse14 (and .cse17 .cse1)) (.cse3 (<= 0 (+ ~a0~0 44))) (.cse6 (+ ~a0~0 98))) (let ((.cse10 (<= .cse6 0)) (.cse4 (= ~a2~0 2)) (.cse13 (<= (+ ~a0~0 386992) 0)) (.cse8 (and .cse0 (or .cse14 (and .cse17 .cse3)))) (.cse11 (<= 0 (+ ~a0~0 599999))) (.cse7 (<= ~a29~0 43)) (.cse2 (not (= 4 ~a2~0)))) (or (and .cse0 (or (and .cse1 .cse2) (and .cse3 .cse2))) (and .cse4 (and .cse5 (< 0 .cse6))) (and .cse7 (<= 94 ~a0~0) .cse8) (and (and .cse0 .cse9 .cse2) .cse10 .cse11) (and .cse10 (and (<= 0 (+ ~a0~0 140)) .cse7 .cse0)) (and .cse10 (and .cse0 (< 0 .cse12) .cse4)) (and (and .cse0 (<= (+ ~a0~0 147) 0)) .cse11) (and .cse4 .cse13) (and .cse0 (= ~a2~0 3) .cse13) (and .cse14 (<= (+ ~a0~0 61) 0)) (and .cse8 (exists ((v_prenex_3 Int)) (let ((.cse15 (* 9 v_prenex_3))) (let ((.cse16 (div .cse15 10))) (and (= 0 (mod .cse15 10)) (<= ~a29~0 (+ (mod .cse16 29) 14)) (<= 0 .cse16)))))) (and (and (= ~a2~0 1) .cse7 (< 0 (+ ~a29~0 144))) .cse0 .cse11) (and .cse7 .cse5 .cse2))))))) [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L183(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,313 INFO L425 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L51(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2018-11-06 21:34:51,314 INFO L425 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L186(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L54(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,315 INFO L425 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L189(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L57(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:34:51,316 INFO L425 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L192(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L60(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:34:51,317 INFO L425 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L195(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L63(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,318 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L198(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L66(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,319 INFO L425 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L201(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L69(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L421 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse12 (+ ~a4~0 86))) (let ((.cse5 (<= .cse12 0)) (.cse9 (not (= 2 ~a2~0)))) (let ((.cse17 (not (= 5 ~a2~0))) (.cse1 (and .cse5 .cse9))) (let ((.cse0 (<= (+ ~a4~0 42) 0)) (.cse14 (and .cse17 .cse1)) (.cse3 (<= 0 (+ ~a0~0 44))) (.cse6 (+ ~a0~0 98))) (let ((.cse10 (<= .cse6 0)) (.cse4 (= ~a2~0 2)) (.cse13 (<= (+ ~a0~0 386992) 0)) (.cse8 (and .cse0 (or .cse14 (and .cse17 .cse3)))) (.cse11 (<= 0 (+ ~a0~0 599999))) (.cse7 (<= ~a29~0 43)) (.cse2 (not (= 4 ~a2~0)))) (or (and .cse0 (or (and .cse1 .cse2) (and .cse3 .cse2))) (and .cse4 (and .cse5 (< 0 .cse6))) (and .cse7 (<= 94 ~a0~0) .cse8) (and (and .cse0 .cse9 .cse2) .cse10 .cse11) (and .cse10 (and (<= 0 (+ ~a0~0 140)) .cse7 .cse0)) (and .cse10 (and .cse0 (< 0 .cse12) .cse4)) (and (and .cse0 (<= (+ ~a0~0 147) 0)) .cse11) (and .cse4 .cse13) (and .cse0 (= ~a2~0 3) .cse13) (and .cse14 (<= (+ ~a0~0 61) 0)) (and .cse8 (exists ((v_prenex_3 Int)) (let ((.cse15 (* 9 v_prenex_3))) (let ((.cse16 (div .cse15 10))) (and (= 0 (mod .cse15 10)) (<= ~a29~0 (+ (mod .cse16 29) 14)) (<= 0 .cse16)))))) (and (and (= ~a2~0 1) .cse7 (< 0 (+ ~a29~0 144))) .cse0 .cse11) (and .cse7 .cse5 .cse2))))))) [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:34:51,320 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L204(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L72(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:34:51,321 INFO L425 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L75(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:34:51,322 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L78(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:34:51,323 INFO L425 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L81(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,324 INFO L425 ceAbstractionStarter]: For program point L84(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,325 INFO L425 ceAbstractionStarter]: For program point L87(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L90(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,326 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L93(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2018-11-06 21:34:51,327 INFO L425 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L96(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,328 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L99(lines 23 1656) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,329 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2018-11-06 21:34:51,330 INFO L425 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2018-11-06 21:34:51,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:34:51 BoogieIcfgContainer [2018-11-06 21:34:51,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:34:51,368 INFO L168 Benchmark]: Toolchain (without parser) took 190109.01 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -379.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,369 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:34:51,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1329.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 422.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -888.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,372 INFO L168 Benchmark]: Boogie Preprocessor took 225.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,372 INFO L168 Benchmark]: RCFGBuilder took 8308.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 315.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,373 INFO L168 Benchmark]: TraceAbstraction took 179817.16 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 59.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 21:34:51,379 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1329.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 422.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -888.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 225.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8308.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 315.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 179817.16 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 59.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: 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: 1766]: Loop Invariant [2018-11-06 21:34:51,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a4 + 42 <= 0 && (((a4 + 86 <= 0 && !(2 == a2)) && !(4 == a2)) || (0 <= a0 + 44 && !(4 == a2)))) || (a2 == 2 && a4 + 86 <= 0 && 0 < a0 + 98)) || ((a29 <= 43 && 94 <= a0) && a4 + 42 <= 0 && ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) || (!(5 == a2) && 0 <= a0 + 44)))) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && (0 <= a0 + 140 && a29 <= 43) && a4 + 42 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0)) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 386992 <= 0)) || ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || ((a29 <= 43 && a4 + 86 <= 0) && !(4 == a2)) - InvariantResult [Line: 23]: Loop Invariant [2018-11-06 21:34:51,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,403 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,404 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((a4 + 42 <= 0 && (((a4 + 86 <= 0 && !(2 == a2)) && !(4 == a2)) || (0 <= a0 + 44 && !(4 == a2)))) || (a2 == 2 && a4 + 86 <= 0 && 0 < a0 + 98)) || ((a29 <= 43 && 94 <= a0) && a4 + 42 <= 0 && ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) || (!(5 == a2) && 0 <= a0 + 44)))) || ((((a4 + 42 <= 0 && !(2 == a2)) && !(4 == a2)) && a0 + 98 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && (0 <= a0 + 140 && a29 <= 43) && a4 + 42 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a2 == 2 && a0 + 386992 <= 0)) || ((a4 + 42 <= 0 && a2 == 3) && a0 + 386992 <= 0)) || ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && ((!(5 == a2) && a4 + 86 <= 0 && !(2 == a2)) || (!(5 == a2) && 0 <= a0 + 44))) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || ((((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || ((a29 <= 43 && a4 + 86 <= 0) && !(4 == a2)) - InvariantResult [Line: 1658]: Loop Invariant [2018-11-06 21:34:51,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,406 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,412 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,412 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2018-11-06 21:34:51,413 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: (((((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 599999) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 <= a0 + 140) && a29 <= 43)) || (a2 == 2 && a0 + 386992 <= 0)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && ((a4 + 42 <= 0 && !(2 == a2)) && 0 < a0 + 147) && !(4 == a2))) || ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 98) || 0 <= a0 + 44)) && (\exists v_prenex_3 : int :: (0 == 9 * v_prenex_3 % 10 && a29 <= 9 * v_prenex_3 / 10 % 29 + 14) && 0 <= 9 * v_prenex_3 / 10))) || ((a29 <= 43 && 94 <= a0) && a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 98) || 0 <= a0 + 44))) || (a4 + 42 <= 0 && ((0 <= a0 + 44 && !(4 == a2)) || ((a4 + 86 <= 0 && !(2 == a2)) && !(4 == a2))))) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(2 == a2))) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a2 == 2 && a4 + 86 <= 0 && 0 < a0 + 98)) || ((a29 <= 43 && a4 + 86 <= 0) && !(4 == a2)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 425 locations, 1 error locations. SAFE Result, 179.7s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 144.6s AutomataDifference, 0.0s DeadEndRemovalTime, 13.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 4174 SDtfs, 15955 SDslu, 2292 SDs, 0 SdLazy, 37612 SolverSat, 5729 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 132.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2160 GetRequests, 2091 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19603occurred in iteration=13, 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 35075 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 172 NumberOfFragments, 905 HoareAnnotationTreeSize, 4 FomulaSimplifications, 75033 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 68084 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 11068 NumberOfCodeBlocks, 11068 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 11048 ConstructedInterpolants, 52 QuantifiedInterpolants, 20760804 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2481 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 11973/12679 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...