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/Problem11_label35_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:04:20,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:04:20,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:04:20,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:04:20,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:04:20,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:04:20,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:04:20,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:04:20,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:04:20,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:04:20,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:04:20,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:04:20,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:04:20,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:04:20,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:04:20,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:04:20,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:04:20,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:04:20,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:04:20,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:04:20,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:04:20,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:04:20,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:04:20,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:04:20,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:04:20,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:04:20,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:04:20,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:04:20,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:04:20,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:04:20,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:04:20,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:04:20,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:04:20,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:04:20,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:04:20,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:04:20,702 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:04:20,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:04:20,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:04:20,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:04:20,718 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:04:20,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:04:20,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:04:20,719 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:04:20,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:04:20,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:04:20,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:04:20,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:04:20,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:04:20,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:04:20,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:04:20,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:04:20,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:04:20,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:04:20,721 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:04:20,721 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:04:20,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:04:20,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:04:20,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:04:20,722 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:04:20,722 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:04:20,722 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:04:20,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:04:20,723 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:04:20,723 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:04:20,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:04:20,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:04:20,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:04:20,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:04:20,784 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:04:20,785 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label35_true-unreach-call.c [2018-11-06 21:04:20,840 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6460d7a0/c1dcbcf56d6c46f59674cd97290c996e/FLAGa14ce7d57 [2018-11-06 21:04:21,556 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:04:21,556 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label35_true-unreach-call.c [2018-11-06 21:04:21,591 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6460d7a0/c1dcbcf56d6c46f59674cd97290c996e/FLAGa14ce7d57 [2018-11-06 21:04:21,614 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6460d7a0/c1dcbcf56d6c46f59674cd97290c996e [2018-11-06 21:04:21,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:04:21,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:04:21,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:21,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:04:21,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:04:21,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:21" (1/1) ... [2018-11-06 21:04:21,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60826613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:21, skipping insertion in model container [2018-11-06 21:04:21,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:21" (1/1) ... [2018-11-06 21:04:21,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:04:21,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:04:22,420 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:22,425 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:04:22,645 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:22,676 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:04:22,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22 WrapperNode [2018-11-06 21:04:22,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:22,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:22,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:04:22,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:04:22,696 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:04:22" (1/1) ... [2018-11-06 21:04:22,859 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:04:22" (1/1) ... [2018-11-06 21:04:22,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:22,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:04:22,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:04:22,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:04:22,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:22,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (1/1) ... [2018-11-06 21:04:23,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:04:23,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:04:23,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:04:23,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:04:23,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (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:04:23,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:04:23,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:04:23,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:04:27,494 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:04:27,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:27 BoogieIcfgContainer [2018-11-06 21:04:27,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:04:27,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:04:27,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:04:27,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:04:27,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:04:21" (1/3) ... [2018-11-06 21:04:27,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a569692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:27, skipping insertion in model container [2018-11-06 21:04:27,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:22" (2/3) ... [2018-11-06 21:04:27,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a569692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:27, skipping insertion in model container [2018-11-06 21:04:27,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:27" (3/3) ... [2018-11-06 21:04:27,504 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label35_true-unreach-call.c [2018-11-06 21:04:27,514 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:04:27,524 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:04:27,542 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:04:27,580 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:04:27,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:04:27,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:04:27,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:04:27,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:04:27,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:04:27,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:04:27,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:04:27,582 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:04:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:04:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-06 21:04:27,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:27,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:27,627 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:27,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1281577798, now seen corresponding path program 1 times [2018-11-06 21:04:27,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:27,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:28,202 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:04:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:28,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:28,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:28,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:28,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:28,234 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:04:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:31,083 INFO L93 Difference]: Finished difference Result 958 states and 1725 transitions. [2018-11-06 21:04:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:31,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-06 21:04:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:31,110 INFO L225 Difference]: With dead ends: 958 [2018-11-06 21:04:31,110 INFO L226 Difference]: Without dead ends: 667 [2018-11-06 21:04:31,115 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:04:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-06 21:04:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-11-06 21:04:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-11-06 21:04:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 983 transitions. [2018-11-06 21:04:31,209 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 983 transitions. Word has length 59 [2018-11-06 21:04:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:31,209 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 983 transitions. [2018-11-06 21:04:31,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 983 transitions. [2018-11-06 21:04:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-06 21:04:31,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:31,216 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:31,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash -918079649, now seen corresponding path program 1 times [2018-11-06 21:04:31,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:31,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:31,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:31,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:31,679 INFO L87 Difference]: Start difference. First operand 667 states and 983 transitions. Second operand 5 states. [2018-11-06 21:04:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:37,343 INFO L93 Difference]: Finished difference Result 2465 states and 3702 transitions. [2018-11-06 21:04:37,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:37,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-06 21:04:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:37,354 INFO L225 Difference]: With dead ends: 2465 [2018-11-06 21:04:37,354 INFO L226 Difference]: Without dead ends: 1800 [2018-11-06 21:04:37,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2018-11-06 21:04:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1795. [2018-11-06 21:04:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-11-06 21:04:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2358 transitions. [2018-11-06 21:04:37,436 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2358 transitions. Word has length 129 [2018-11-06 21:04:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 1795 states and 2358 transitions. [2018-11-06 21:04:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2358 transitions. [2018-11-06 21:04:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-06 21:04:37,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:37,450 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:37,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:37,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1989748220, now seen corresponding path program 1 times [2018-11-06 21:04:37,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:37,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:37,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:37,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:37,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:37,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:37,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:37,824 INFO L87 Difference]: Start difference. First operand 1795 states and 2358 transitions. Second operand 4 states. [2018-11-06 21:04:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:40,352 INFO L93 Difference]: Finished difference Result 6759 states and 8947 transitions. [2018-11-06 21:04:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:40,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-06 21:04:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:40,381 INFO L225 Difference]: With dead ends: 6759 [2018-11-06 21:04:40,381 INFO L226 Difference]: Without dead ends: 4966 [2018-11-06 21:04:40,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2018-11-06 21:04:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4389. [2018-11-06 21:04:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2018-11-06 21:04:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 5560 transitions. [2018-11-06 21:04:40,480 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 5560 transitions. Word has length 187 [2018-11-06 21:04:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:40,480 INFO L480 AbstractCegarLoop]: Abstraction has 4389 states and 5560 transitions. [2018-11-06 21:04:40,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 5560 transitions. [2018-11-06 21:04:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 21:04:40,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:40,489 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, 3, 3, 3, 3, 3, 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] [2018-11-06 21:04:40,489 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:40,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1397134196, now seen corresponding path program 1 times [2018-11-06 21:04:40,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 21:04:40,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:40,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:40,858 INFO L87 Difference]: Start difference. First operand 4389 states and 5560 transitions. Second operand 4 states. [2018-11-06 21:04:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:45,191 INFO L93 Difference]: Finished difference Result 10828 states and 13764 transitions. [2018-11-06 21:04:45,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:45,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-11-06 21:04:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:45,223 INFO L225 Difference]: With dead ends: 10828 [2018-11-06 21:04:45,223 INFO L226 Difference]: Without dead ends: 6441 [2018-11-06 21:04:45,230 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:04:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-11-06 21:04:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 6238. [2018-11-06 21:04:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6238 states. [2018-11-06 21:04:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 7579 transitions. [2018-11-06 21:04:45,347 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 7579 transitions. Word has length 256 [2018-11-06 21:04:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:45,347 INFO L480 AbstractCegarLoop]: Abstraction has 6238 states and 7579 transitions. [2018-11-06 21:04:45,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 7579 transitions. [2018-11-06 21:04:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-11-06 21:04:45,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:45,357 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,357 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:45,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1341410710, now seen corresponding path program 1 times [2018-11-06 21:04:45,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:45,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-06 21:04:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:45,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:04:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:04:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:45,671 INFO L87 Difference]: Start difference. First operand 6238 states and 7579 transitions. Second operand 3 states. [2018-11-06 21:04:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:47,554 INFO L93 Difference]: Finished difference Result 13213 states and 16347 transitions. [2018-11-06 21:04:47,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:47,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-11-06 21:04:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:47,586 INFO L225 Difference]: With dead ends: 13213 [2018-11-06 21:04:47,587 INFO L226 Difference]: Without dead ends: 6977 [2018-11-06 21:04:47,597 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:04:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2018-11-06 21:04:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 6977. [2018-11-06 21:04:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-11-06 21:04:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 8521 transitions. [2018-11-06 21:04:47,725 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 8521 transitions. Word has length 275 [2018-11-06 21:04:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:47,726 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 8521 transitions. [2018-11-06 21:04:47,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:04:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 8521 transitions. [2018-11-06 21:04:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-06 21:04:47,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:47,737 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:47,738 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:47,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash 145349327, now seen corresponding path program 1 times [2018-11-06 21:04:47,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:47,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:48,336 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:04:48,688 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-06 21:04:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:48,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:48,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:04:48,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:48,792 INFO L87 Difference]: Start difference. First operand 6977 states and 8521 transitions. Second operand 5 states. [2018-11-06 21:04:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:51,653 INFO L93 Difference]: Finished difference Result 16009 states and 19915 transitions. [2018-11-06 21:04:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:51,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2018-11-06 21:04:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:51,688 INFO L225 Difference]: With dead ends: 16009 [2018-11-06 21:04:51,689 INFO L226 Difference]: Without dead ends: 9034 [2018-11-06 21:04:51,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9034 states. [2018-11-06 21:04:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9034 to 8647. [2018-11-06 21:04:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8647 states. [2018-11-06 21:04:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8647 states to 8647 states and 10537 transitions. [2018-11-06 21:04:51,840 INFO L78 Accepts]: Start accepts. Automaton has 8647 states and 10537 transitions. Word has length 278 [2018-11-06 21:04:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:51,841 INFO L480 AbstractCegarLoop]: Abstraction has 8647 states and 10537 transitions. [2018-11-06 21:04:51,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8647 states and 10537 transitions. [2018-11-06 21:04:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-06 21:04:51,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:51,851 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,852 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash 62645169, now seen corresponding path program 1 times [2018-11-06 21:04:51,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:52,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:52,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:52,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:52,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:52,294 INFO L87 Difference]: Start difference. First operand 8647 states and 10537 transitions. Second operand 4 states. [2018-11-06 21:04:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:54,336 INFO L93 Difference]: Finished difference Result 20439 states and 25150 transitions. [2018-11-06 21:04:54,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:54,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-11-06 21:04:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:54,357 INFO L225 Difference]: With dead ends: 20439 [2018-11-06 21:04:54,358 INFO L226 Difference]: Without dead ends: 10856 [2018-11-06 21:04:54,369 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:04:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2018-11-06 21:04:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 10665. [2018-11-06 21:04:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2018-11-06 21:04:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 12552 transitions. [2018-11-06 21:04:54,504 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 12552 transitions. Word has length 294 [2018-11-06 21:04:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:54,504 INFO L480 AbstractCegarLoop]: Abstraction has 10665 states and 12552 transitions. [2018-11-06 21:04:54,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 12552 transitions. [2018-11-06 21:04:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-06 21:04:54,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:54,520 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:04:54,520 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:54,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 543159351, now seen corresponding path program 1 times [2018-11-06 21:04:54,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:54,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:55,191 WARN L179 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:04:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 21:04:55,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:55,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:55,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:55,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:55,288 INFO L87 Difference]: Start difference. First operand 10665 states and 12552 transitions. Second operand 4 states. [2018-11-06 21:04:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:58,776 INFO L93 Difference]: Finished difference Result 21716 states and 25512 transitions. [2018-11-06 21:04:58,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:58,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2018-11-06 21:04:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:58,797 INFO L225 Difference]: With dead ends: 21716 [2018-11-06 21:04:58,797 INFO L226 Difference]: Without dead ends: 10864 [2018-11-06 21:04:58,807 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:04:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10864 states. [2018-11-06 21:04:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10864 to 10291. [2018-11-06 21:04:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10291 states. [2018-11-06 21:04:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10291 states to 10291 states and 11864 transitions. [2018-11-06 21:04:58,935 INFO L78 Accepts]: Start accepts. Automaton has 10291 states and 11864 transitions. Word has length 344 [2018-11-06 21:04:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 10291 states and 11864 transitions. [2018-11-06 21:04:58,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 10291 states and 11864 transitions. [2018-11-06 21:04:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-11-06 21:04:58,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:58,954 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:58,954 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:58,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1626505021, now seen corresponding path program 1 times [2018-11-06 21:04:58,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:58,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:58,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 125 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:00,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:00,060 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:05:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:00,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 181 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:01,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:01,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-06 21:05:01,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:05:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:05:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:05:01,024 INFO L87 Difference]: Start difference. First operand 10291 states and 11864 transitions. Second operand 10 states. [2018-11-06 21:05:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:14,390 INFO L93 Difference]: Finished difference Result 38231 states and 43890 transitions. [2018-11-06 21:05:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:05:14,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 359 [2018-11-06 21:05:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:14,443 INFO L225 Difference]: With dead ends: 38231 [2018-11-06 21:05:14,443 INFO L226 Difference]: Without dead ends: 26825 [2018-11-06 21:05:14,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:05:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26825 states. [2018-11-06 21:05:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26825 to 16404. [2018-11-06 21:05:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16404 states. [2018-11-06 21:05:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16404 states to 16404 states and 18427 transitions. [2018-11-06 21:05:14,812 INFO L78 Accepts]: Start accepts. Automaton has 16404 states and 18427 transitions. Word has length 359 [2018-11-06 21:05:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:14,813 INFO L480 AbstractCegarLoop]: Abstraction has 16404 states and 18427 transitions. [2018-11-06 21:05:14,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:05:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16404 states and 18427 transitions. [2018-11-06 21:05:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-06 21:05:14,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:14,834 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, 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, 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:05:14,834 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:14,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash 45905770, now seen corresponding path program 1 times [2018-11-06 21:05:14,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:14,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:14,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:14,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 294 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 21:05:15,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:15,436 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:05:15,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:15,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:16,572 WARN L179 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 32 [2018-11-06 21:05:17,276 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 40 [2018-11-06 21:05:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 196 proven. 155 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:05:18,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:18,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:05:18,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:05:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:05:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:05:18,271 INFO L87 Difference]: Start difference. First operand 16404 states and 18427 transitions. Second operand 9 states. [2018-11-06 21:05:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:30,730 INFO L93 Difference]: Finished difference Result 43029 states and 48466 transitions. [2018-11-06 21:05:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-06 21:05:30,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 361 [2018-11-06 21:05:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:30,774 INFO L225 Difference]: With dead ends: 43029 [2018-11-06 21:05:30,774 INFO L226 Difference]: Without dead ends: 26254 [2018-11-06 21:05:30,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-11-06 21:05:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26254 states. [2018-11-06 21:05:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26254 to 13605. [2018-11-06 21:05:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13605 states. [2018-11-06 21:05:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13605 states to 13605 states and 15029 transitions. [2018-11-06 21:05:31,018 INFO L78 Accepts]: Start accepts. Automaton has 13605 states and 15029 transitions. Word has length 361 [2018-11-06 21:05:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:31,018 INFO L480 AbstractCegarLoop]: Abstraction has 13605 states and 15029 transitions. [2018-11-06 21:05:31,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:05:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 13605 states and 15029 transitions. [2018-11-06 21:05:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-11-06 21:05:31,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:31,046 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:31,046 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:31,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:31,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1268095058, now seen corresponding path program 1 times [2018-11-06 21:05:31,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:31,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:31,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:31,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:31,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 148 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:31,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:31,701 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:05:31,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:31,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:32,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:32,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:05:32,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:05:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:05:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:05:32,977 INFO L87 Difference]: Start difference. First operand 13605 states and 15029 transitions. Second operand 10 states. [2018-11-06 21:05:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:42,926 INFO L93 Difference]: Finished difference Result 37257 states and 41127 transitions. [2018-11-06 21:05:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:05:42,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 457 [2018-11-06 21:05:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:42,954 INFO L225 Difference]: With dead ends: 37257 [2018-11-06 21:05:42,954 INFO L226 Difference]: Without dead ends: 23094 [2018-11-06 21:05:42,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-06 21:05:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23094 states. [2018-11-06 21:05:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23094 to 16015. [2018-11-06 21:05:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16015 states. [2018-11-06 21:05:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 17516 transitions. [2018-11-06 21:05:43,206 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 17516 transitions. Word has length 457 [2018-11-06 21:05:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:43,207 INFO L480 AbstractCegarLoop]: Abstraction has 16015 states and 17516 transitions. [2018-11-06 21:05:43,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:05:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 17516 transitions. [2018-11-06 21:05:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-11-06 21:05:43,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:43,237 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, 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, 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] [2018-11-06 21:05:43,237 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:43,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1753866870, now seen corresponding path program 1 times [2018-11-06 21:05:43,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:43,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-06 21:05:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:43,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:43,928 INFO L87 Difference]: Start difference. First operand 16015 states and 17516 transitions. Second operand 5 states. [2018-11-06 21:05:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:46,289 INFO L93 Difference]: Finished difference Result 42045 states and 45936 transitions. [2018-11-06 21:05:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:46,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 533 [2018-11-06 21:05:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:46,320 INFO L225 Difference]: With dead ends: 42045 [2018-11-06 21:05:46,321 INFO L226 Difference]: Without dead ends: 24913 [2018-11-06 21:05:46,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24913 states. [2018-11-06 21:05:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24913 to 22309. [2018-11-06 21:05:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22309 states. [2018-11-06 21:05:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22309 states to 22309 states and 24334 transitions. [2018-11-06 21:05:46,654 INFO L78 Accepts]: Start accepts. Automaton has 22309 states and 24334 transitions. Word has length 533 [2018-11-06 21:05:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:46,654 INFO L480 AbstractCegarLoop]: Abstraction has 22309 states and 24334 transitions. [2018-11-06 21:05:46,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22309 states and 24334 transitions. [2018-11-06 21:05:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-11-06 21:05:46,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:46,687 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:46,687 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:46,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1460342239, now seen corresponding path program 1 times [2018-11-06 21:05:46,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:46,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:46,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:47,525 WARN L179 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:05:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 1028 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-06 21:05:47,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:47,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:47,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:47,992 INFO L87 Difference]: Start difference. First operand 22309 states and 24334 transitions. Second operand 4 states. [2018-11-06 21:05:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:50,411 INFO L93 Difference]: Finished difference Result 43515 states and 47515 transitions. [2018-11-06 21:05:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:50,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 659 [2018-11-06 21:05:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:50,431 INFO L225 Difference]: With dead ends: 43515 [2018-11-06 21:05:50,431 INFO L226 Difference]: Without dead ends: 21578 [2018-11-06 21:05:50,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21578 states. [2018-11-06 21:05:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21578 to 21193. [2018-11-06 21:05:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21193 states. [2018-11-06 21:05:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21193 states to 21193 states and 22962 transitions. [2018-11-06 21:05:50,700 INFO L78 Accepts]: Start accepts. Automaton has 21193 states and 22962 transitions. Word has length 659 [2018-11-06 21:05:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:50,700 INFO L480 AbstractCegarLoop]: Abstraction has 21193 states and 22962 transitions. [2018-11-06 21:05:50,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 21193 states and 22962 transitions. [2018-11-06 21:05:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-11-06 21:05:50,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:50,717 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:50,717 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:50,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash 474499652, now seen corresponding path program 1 times [2018-11-06 21:05:50,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:50,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:50,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:50,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:50,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-11-06 21:05:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:51,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:51,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:51,381 INFO L87 Difference]: Start difference. First operand 21193 states and 22962 transitions. Second operand 3 states. [2018-11-06 21:05:52,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:52,608 INFO L93 Difference]: Finished difference Result 44417 states and 48108 transitions. [2018-11-06 21:05:52,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:52,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 739 [2018-11-06 21:05:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:52,609 INFO L225 Difference]: With dead ends: 44417 [2018-11-06 21:05:52,609 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:05:52,623 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:05:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:05:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:05:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:05:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:05:52,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 739 [2018-11-06 21:05:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:52,624 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:05:52,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:05:52,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:05:52,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:05:52,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:52,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:53,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,299 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 705 DAG size of output: 492 [2018-11-06 21:05:54,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,534 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 705 DAG size of output: 492 [2018-11-06 21:06:04,115 WARN L179 SmtUtils]: Spent 8.57 s on a formula simplification. DAG size of input: 435 DAG size of output: 141 [2018-11-06 21:06:12,412 WARN L179 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 435 DAG size of output: 141 [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,416 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,417 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:06:12,418 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:06:12,419 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,419 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:06:12,419 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse12 (= ~a4~0 1))) (let ((.cse18 (+ ~a23~0 43)) (.cse31 (not (= ~a25~0 13))) (.cse25 (not .cse12))) (let ((.cse24 (= ~a25~0 10)) (.cse4 (= ~a25~0 11)) (.cse8 (= ~a25~0 12)) (.cse16 (and .cse31 .cse25)) (.cse26 (<= ~a29~0 245)) (.cse13 (<= .cse18 0)) (.cse22 (< 138 ~a23~0))) (let ((.cse19 (<= ~a29~0 140)) (.cse6 (or .cse13 .cse22)) (.cse15 (<= ~a29~0 599998)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse32 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse32 299861) 300138)) (<= 0 .cse32))))) (.cse0 (and .cse8 .cse16 .cse26)) (.cse2 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse27 (<= ~a29~0 220)) (.cse21 (<= (+ ~a29~0 275923) 0)) (.cse28 (<= 312 ~a23~0)) (.cse9 (< 245 ~a29~0)) (.cse5 (= 1 ~a4~0)) (.cse1 (<= 130 ~a29~0)) (.cse14 (= ~a25~0 9)) (.cse20 (not .cse4)) (.cse17 (<= ~a23~0 312)) (.cse29 (not .cse8)) (.cse10 (<= ~a29~0 277)) (.cse23 (not .cse24))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse5 .cse4) (and .cse2 (and .cse8 .cse9) .cse3 .cse10 .cse6) (and (exists ((v_~a29~0_499 Int)) (let ((.cse11 (mod (+ v_~a29~0_499 33) 52))) (and (< v_~a29~0_499 5479) (<= v_~a29~0_499 277) (<= ~a29~0 (+ .cse11 141)) (< 245 v_~a29~0_499) (not (= 0 .cse11))))) .cse8 .cse12 .cse13) (and .cse14 .cse15 .cse1 .cse13) (and (and .cse8 .cse16 .cse9) .cse10) (and .cse17 .cse14 (< 0 .cse18) .cse19) (and .cse20 .cse21 .cse5 .cse22 .cse23) (and .cse24 .cse25 .cse19) (and (and .cse26 .cse4 .cse1) .cse5) (and (and (<= 13 ~a25~0) .cse2 .cse3 .cse26) .cse5 .cse1) (and (and .cse24 .cse6) .cse10 .cse5 .cse1) (and (and .cse2 .cse3 .cse26 .cse22) .cse5) (and .cse14 .cse12 .cse13) (and .cse8 .cse10 .cse1 .cse13) (and (and .cse8 (<= (+ ~a29~0 22) 0)) .cse17) (and (and .cse9 .cse4) .cse10 .cse5) (and (or (and .cse26 .cse24 .cse1) (and .cse2 .cse3 .cse27 .cse24)) .cse5) (and .cse2 .cse3 .cse24 .cse5 .cse6) (and .cse12 .cse4 .cse13) (and (and .cse26 (and .cse14 .cse28)) .cse5) (and .cse15 .cse4 .cse13) (and .cse2 .cse7 .cse29 .cse3 .cse5 .cse22) (and .cse21 .cse0) (and .cse14 .cse2 .cse3 .cse5) (and .cse14 .cse21 .cse13) (and .cse8 .cse17 .cse2 .cse3 .cse5 .cse22) (and .cse14 .cse12 .cse27) (let ((.cse30 (and .cse31 (<= ~a29~0 130) .cse28))) (or (and .cse30 .cse5 .cse1) (and .cse30 .cse21 .cse5))) (and .cse12 .cse24 .cse13) (and .cse12 .cse10 .cse9 .cse13) (and .cse17 .cse29 .cse26 .cse5 .cse1 .cse22) (and (not .cse14) .cse20 .cse17 .cse29 .cse10 .cse25 .cse23)))))) [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,420 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,421 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:06:12,422 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,423 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:06:12,424 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:06:12,425 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:12,426 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,427 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,428 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:06:12,429 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,430 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:06:12,431 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,432 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:12,433 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:12,434 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,435 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:06:12,436 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-11-06 21:06:12,437 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,438 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:12,439 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:06:12,440 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,441 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,441 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,441 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse12 (= ~a4~0 1))) (let ((.cse18 (+ ~a23~0 43)) (.cse31 (not (= ~a25~0 13))) (.cse25 (not .cse12))) (let ((.cse24 (= ~a25~0 10)) (.cse4 (= ~a25~0 11)) (.cse8 (= ~a25~0 12)) (.cse16 (and .cse31 .cse25)) (.cse26 (<= ~a29~0 245)) (.cse13 (<= .cse18 0)) (.cse22 (< 138 ~a23~0))) (let ((.cse19 (<= ~a29~0 140)) (.cse6 (or .cse13 .cse22)) (.cse15 (<= ~a29~0 599998)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse32 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse32 299861) 300138)) (<= 0 .cse32))))) (.cse0 (and .cse8 .cse16 .cse26)) (.cse2 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse27 (<= ~a29~0 220)) (.cse21 (<= (+ ~a29~0 275923) 0)) (.cse28 (<= 312 ~a23~0)) (.cse9 (< 245 ~a29~0)) (.cse5 (= 1 ~a4~0)) (.cse1 (<= 130 ~a29~0)) (.cse14 (= ~a25~0 9)) (.cse20 (not .cse4)) (.cse17 (<= ~a23~0 312)) (.cse29 (not .cse8)) (.cse10 (<= ~a29~0 277)) (.cse23 (not .cse24))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse5 .cse4) (and .cse2 (and .cse8 .cse9) .cse3 .cse10 .cse6) (and (exists ((v_~a29~0_499 Int)) (let ((.cse11 (mod (+ v_~a29~0_499 33) 52))) (and (< v_~a29~0_499 5479) (<= v_~a29~0_499 277) (<= ~a29~0 (+ .cse11 141)) (< 245 v_~a29~0_499) (not (= 0 .cse11))))) .cse8 .cse12 .cse13) (and .cse14 .cse15 .cse1 .cse13) (and (and .cse8 .cse16 .cse9) .cse10) (and .cse17 .cse14 (< 0 .cse18) .cse19) (and .cse20 .cse21 .cse5 .cse22 .cse23) (and .cse24 .cse25 .cse19) (and (and .cse26 .cse4 .cse1) .cse5) (and (and (<= 13 ~a25~0) .cse2 .cse3 .cse26) .cse5 .cse1) (and (and .cse24 .cse6) .cse10 .cse5 .cse1) (and (and .cse2 .cse3 .cse26 .cse22) .cse5) (and .cse14 .cse12 .cse13) (and .cse8 .cse10 .cse1 .cse13) (and (and .cse8 (<= (+ ~a29~0 22) 0)) .cse17) (and (and .cse9 .cse4) .cse10 .cse5) (and (or (and .cse26 .cse24 .cse1) (and .cse2 .cse3 .cse27 .cse24)) .cse5) (and .cse2 .cse3 .cse24 .cse5 .cse6) (and .cse12 .cse4 .cse13) (and (and .cse26 (and .cse14 .cse28)) .cse5) (and .cse15 .cse4 .cse13) (and .cse2 .cse7 .cse29 .cse3 .cse5 .cse22) (and .cse21 .cse0) (and .cse14 .cse2 .cse3 .cse5) (and .cse14 .cse21 .cse13) (and .cse8 .cse17 .cse2 .cse3 .cse5 .cse22) (and .cse14 .cse12 .cse27) (let ((.cse30 (and .cse31 (<= ~a29~0 130) .cse28))) (or (and .cse30 .cse5 .cse1) (and .cse30 .cse21 .cse5))) (and .cse12 .cse24 .cse13) (and .cse12 .cse10 .cse9 .cse13) (and .cse17 .cse29 .cse26 .cse5 .cse1 .cse22) (and (not .cse14) .cse20 .cse17 .cse29 .cse10 .cse25 .cse23)))))) [2018-11-06 21:06:12,441 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,441 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,442 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,489 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,490 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:12 BoogieIcfgContainer [2018-11-06 21:06:12,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:12,498 INFO L168 Benchmark]: Toolchain (without parser) took 110870.32 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,500 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:06:12,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1049.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 300.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,502 INFO L168 Benchmark]: Boogie Preprocessor took 126.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:06:12,502 INFO L168 Benchmark]: RCFGBuilder took 4385.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 199.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,503 INFO L168 Benchmark]: TraceAbstraction took 105001.07 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -613.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,508 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 1049.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 300.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -828.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4385.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 199.5 MB). Peak memory consumption was 199.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105001.07 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -613.0 MB). Peak memory consumption was 1.6 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_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 180]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-11-06 21:06:12,521 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,521 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,521 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,522 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,522 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,522 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,524 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,524 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,524 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,526 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,527 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,527 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,529 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,529 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a25 == 12 && !(a25 == 13) && !(a4 == 1)) && a29 <= 245) && 130 <= a29) || ((((1 == a3 && 15 == a8) && a25 == 11) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || ((((1 == a3 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((1 == a3 && a25 == 12 && 245 < a29) && 15 == a8) && a29 <= 277) && (a23 + 43 <= 0 || 138 < a23))) || ((((\exists v_~a29~0_499 : int :: (((v_~a29~0_499 < 5479 && v_~a29~0_499 <= 277) && a29 <= (v_~a29~0_499 + 33) % 52 + 141) && 245 < v_~a29~0_499) && !(0 == (v_~a29~0_499 + 33) % 52)) && a25 == 12) && a4 == 1) && a23 + 43 <= 0)) || (((a25 == 9 && a29 <= 599998) && 130 <= a29) && a23 + 43 <= 0)) || (((a25 == 12 && !(a25 == 13) && !(a4 == 1)) && 245 < a29) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && a29 <= 140)) || ((((!(a25 == 11) && a29 + 275923 <= 0) && 1 == a4) && 138 < a23) && !(a25 == 10))) || ((a25 == 10 && !(a4 == 1)) && a29 <= 140)) || (((a29 <= 245 && a25 == 11) && 130 <= a29) && 1 == a4)) || (((((13 <= a25 && 1 == a3) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29)) || ((((a25 == 10 && (a23 + 43 <= 0 || 138 < a23)) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 138 < a23) && 1 == a4)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((a25 == 12 && a29 <= 277) && 130 <= a29) && a23 + 43 <= 0)) || ((a25 == 12 && a29 + 22 <= 0) && a23 <= 312)) || (((245 < a29 && a25 == 11) && a29 <= 277) && 1 == a4)) || ((((a29 <= 245 && a25 == 10) && 130 <= a29) || (((1 == a3 && 15 == a8) && a29 <= 220) && a25 == 10)) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || ((a4 == 1 && a25 == 11) && a23 + 43 <= 0)) || ((a29 <= 245 && a25 == 9 && 312 <= a23) && 1 == a4)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (((((1 == a3 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && !(a25 == 12)) && 15 == a8) && 1 == a4) && 138 < a23)) || (a29 + 275923 <= 0 && (a25 == 12 && !(a25 == 13) && !(a4 == 1)) && a29 <= 245)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a25 == 9 && a29 + 275923 <= 0) && a23 + 43 <= 0)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 9 && a4 == 1) && a29 <= 220)) || ((((!(a25 == 13) && a29 <= 130) && 312 <= a23) && 1 == a4) && 130 <= a29) || ((((!(a25 == 13) && a29 <= 130) && 312 <= a23) && a29 + 275923 <= 0) && 1 == a4)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a4 == 1 && a29 <= 277) && 245 < a29) && a23 + 43 <= 0)) || (((((a23 <= 312 && !(a25 == 12)) && a29 <= 245) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((((!(a25 == 9) && !(a25 == 11)) && a23 <= 312) && !(a25 == 12)) && a29 <= 277) && !(a4 == 1)) && !(a25 == 10)) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:06:12,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,535 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,535 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,538 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,538 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,539 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,539 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,540 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,540 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,540 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2018-11-06 21:06:12,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2018-11-06 21:06:12,542 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a25 == 12 && !(a25 == 13) && !(a4 == 1)) && a29 <= 245) && 130 <= a29) || ((((1 == a3 && 15 == a8) && a25 == 11) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || ((((1 == a3 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((1 == a3 && a25 == 12 && 245 < a29) && 15 == a8) && a29 <= 277) && (a23 + 43 <= 0 || 138 < a23))) || ((((\exists v_~a29~0_499 : int :: (((v_~a29~0_499 < 5479 && v_~a29~0_499 <= 277) && a29 <= (v_~a29~0_499 + 33) % 52 + 141) && 245 < v_~a29~0_499) && !(0 == (v_~a29~0_499 + 33) % 52)) && a25 == 12) && a4 == 1) && a23 + 43 <= 0)) || (((a25 == 9 && a29 <= 599998) && 130 <= a29) && a23 + 43 <= 0)) || (((a25 == 12 && !(a25 == 13) && !(a4 == 1)) && 245 < a29) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && a29 <= 140)) || ((((!(a25 == 11) && a29 + 275923 <= 0) && 1 == a4) && 138 < a23) && !(a25 == 10))) || ((a25 == 10 && !(a4 == 1)) && a29 <= 140)) || (((a29 <= 245 && a25 == 11) && 130 <= a29) && 1 == a4)) || (((((13 <= a25 && 1 == a3) && 15 == a8) && a29 <= 245) && 1 == a4) && 130 <= a29)) || ((((a25 == 10 && (a23 + 43 <= 0 || 138 < a23)) && a29 <= 277) && 1 == a4) && 130 <= a29)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 138 < a23) && 1 == a4)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((a25 == 12 && a29 <= 277) && 130 <= a29) && a23 + 43 <= 0)) || ((a25 == 12 && a29 + 22 <= 0) && a23 <= 312)) || (((245 < a29 && a25 == 11) && a29 <= 277) && 1 == a4)) || ((((a29 <= 245 && a25 == 10) && 130 <= a29) || (((1 == a3 && 15 == a8) && a29 <= 220) && a25 == 10)) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 1 == a4) && (a23 + 43 <= 0 || 138 < a23))) || ((a4 == 1 && a25 == 11) && a23 + 43 <= 0)) || ((a29 <= 245 && a25 == 9 && 312 <= a23) && 1 == a4)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (((((1 == a3 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && !(a25 == 12)) && 15 == a8) && 1 == a4) && 138 < a23)) || (a29 + 275923 <= 0 && (a25 == 12 && !(a25 == 13) && !(a4 == 1)) && a29 <= 245)) || (((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a25 == 9 && a29 + 275923 <= 0) && a23 + 43 <= 0)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 9 && a4 == 1) && a29 <= 220)) || ((((!(a25 == 13) && a29 <= 130) && 312 <= a23) && 1 == a4) && 130 <= a29) || ((((!(a25 == 13) && a29 <= 130) && 312 <= a23) && a29 + 275923 <= 0) && 1 == a4)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a4 == 1 && a29 <= 277) && 245 < a29) && a23 + 43 <= 0)) || (((((a23 <= 312 && !(a25 == 12)) && a29 <= 245) && 1 == a4) && 130 <= a29) && 138 < a23)) || ((((((!(a25 == 9) && !(a25 == 11)) && a23 <= 312) && !(a25 == 12)) && a29 <= 277) && !(a4 == 1)) && !(a25 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 104.8s OverallTime, 14 OverallIterations, 7 TraceHistogramMax, 67.9s AutomataDifference, 0.0s DeadEndRemovalTime, 19.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3324 SDtfs, 13728 SDslu, 2463 SDs, 0 SdLazy, 32958 SolverSat, 6480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1279 GetRequests, 1191 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22309occurred in iteration=12, 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: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 35074 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 308 NumberOfFragments, 1333 HoareAnnotationTreeSize, 3 FomulaSimplifications, 96398 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 47052 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 6107 NumberOfCodeBlocks, 6107 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6090 ConstructedInterpolants, 411 QuantifiedInterpolants, 11697538 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1524 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 6688/7689 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...