java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:29:40,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:29:40,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:29:40,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:29:40,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:29:40,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:29:40,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:29:40,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:29:40,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:29:40,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:29:40,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:29:40,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:29:40,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:29:40,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:29:40,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:29:40,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:29:40,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:29:40,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:29:40,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:29:40,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:29:40,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:29:40,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:29:40,771 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:29:40,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:29:40,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:29:40,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:29:40,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:29:40,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:29:40,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:29:40,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:29:40,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:29:40,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:29:40,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:29:40,781 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:29:40,782 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:29:40,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:29:40,785 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:29:40,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:29:40,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:29:40,812 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:29:40,813 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:29:40,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:29:40,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:29:40,818 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:29:40,819 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:29:40,819 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:29:40,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:29:40,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:29:40,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:29:40,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:29:40,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:29:40,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:29:40,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:29:40,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:29:40,821 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:29:40,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:29:40,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:29:40,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:29:40,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:29:40,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:29:40,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:29:40,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:29:40,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:29:40,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:29:40,823 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:29:40,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:29:40,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:29:40,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:29:40,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:29:40,911 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:29:40,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-10-24 16:29:40,976 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/983bf0c09/624f128997cd475a9f9207b3e1a3291c/FLAG4a1c379f5 [2018-10-24 16:29:41,536 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:29:41,537 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23_true-unreach-call_false-termination.c [2018-10-24 16:29:41,553 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/983bf0c09/624f128997cd475a9f9207b3e1a3291c/FLAG4a1c379f5 [2018-10-24 16:29:41,573 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/983bf0c09/624f128997cd475a9f9207b3e1a3291c [2018-10-24 16:29:41,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:29:41,587 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:29:41,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:29:41,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:29:41,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:29:41,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:41" (1/1) ... [2018-10-24 16:29:41,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570fd3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:41, skipping insertion in model container [2018-10-24 16:29:41,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:41" (1/1) ... [2018-10-24 16:29:41,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:29:41,677 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:29:42,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:29:42,149 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:29:42,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:29:42,313 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:29:42,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42 WrapperNode [2018-10-24 16:29:42,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:29:42,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:29:42,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:29:42,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:29:42,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:29:42,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:29:42,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:29:42,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:29:42,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... [2018-10-24 16:29:42,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:29:42,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:29:42,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:29:42,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:29:42,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:29:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:29:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:29:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:29:46,058 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:29:46,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:46 BoogieIcfgContainer [2018-10-24 16:29:46,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:29:46,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:29:46,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:29:46,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:29:46,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:29:41" (1/3) ... [2018-10-24 16:29:46,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71e3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:46, skipping insertion in model container [2018-10-24 16:29:46,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:42" (2/3) ... [2018-10-24 16:29:46,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b71e3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:46, skipping insertion in model container [2018-10-24 16:29:46,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:46" (3/3) ... [2018-10-24 16:29:46,067 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label23_true-unreach-call_false-termination.c [2018-10-24 16:29:46,075 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:29:46,083 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:29:46,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:29:46,137 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:29:46,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:29:46,138 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:29:46,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:29:46,139 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:29:46,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:29:46,139 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:29:46,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:29:46,140 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:29:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-24 16:29:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 16:29:46,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:46,172 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] [2018-10-24 16:29:46,175 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:46,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 575043410, now seen corresponding path program 1 times [2018-10-24 16:29:46,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:29:46,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:46,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:29:46,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:46,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:46,538 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-24 16:29:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:49,552 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-10-24 16:29:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:49,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-24 16:29:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:49,579 INFO L225 Difference]: With dead ends: 854 [2018-10-24 16:29:49,579 INFO L226 Difference]: Without dead ends: 601 [2018-10-24 16:29:49,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-24 16:29:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-10-24 16:29:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-24 16:29:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1045 transitions. [2018-10-24 16:29:49,676 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1045 transitions. Word has length 33 [2018-10-24 16:29:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:49,677 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 1045 transitions. [2018-10-24 16:29:49,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1045 transitions. [2018-10-24 16:29:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 16:29:49,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:49,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:49,684 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:49,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2032441875, now seen corresponding path program 1 times [2018-10-24 16:29:49,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:49,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:29:49,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:29:49,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:49,984 INFO L87 Difference]: Start difference. First operand 601 states and 1045 transitions. Second operand 4 states. [2018-10-24 16:29:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:52,935 INFO L93 Difference]: Finished difference Result 1379 states and 2382 transitions. [2018-10-24 16:29:52,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:52,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-24 16:29:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:52,942 INFO L225 Difference]: With dead ends: 1379 [2018-10-24 16:29:52,943 INFO L226 Difference]: Without dead ends: 780 [2018-10-24 16:29:52,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-24 16:29:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2018-10-24 16:29:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-10-24 16:29:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1189 transitions. [2018-10-24 16:29:52,985 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1189 transitions. Word has length 104 [2018-10-24 16:29:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:52,986 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 1189 transitions. [2018-10-24 16:29:52,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1189 transitions. [2018-10-24 16:29:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-24 16:29:52,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:52,994 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:52,995 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:52,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2057496071, now seen corresponding path program 1 times [2018-10-24 16:29:52,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:52,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:52,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:52,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 16:29:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:29:53,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:53,417 INFO L87 Difference]: Start difference. First operand 780 states and 1189 transitions. Second operand 4 states. [2018-10-24 16:29:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:56,656 INFO L93 Difference]: Finished difference Result 2643 states and 4039 transitions. [2018-10-24 16:29:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:56,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-24 16:29:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:56,668 INFO L225 Difference]: With dead ends: 2643 [2018-10-24 16:29:56,668 INFO L226 Difference]: Without dead ends: 1865 [2018-10-24 16:29:56,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2018-10-24 16:29:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1865. [2018-10-24 16:29:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2018-10-24 16:29:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2568 transitions. [2018-10-24 16:29:56,713 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2568 transitions. Word has length 179 [2018-10-24 16:29:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:56,713 INFO L481 AbstractCegarLoop]: Abstraction has 1865 states and 2568 transitions. [2018-10-24 16:29:56,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2568 transitions. [2018-10-24 16:29:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 16:29:56,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:56,720 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:29:56,720 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:56,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash -659484655, now seen corresponding path program 1 times [2018-10-24 16:29:56,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:56,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:56,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:29:57,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:57,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:29:57,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:29:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:29:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:29:57,132 INFO L87 Difference]: Start difference. First operand 1865 states and 2568 transitions. Second operand 7 states. [2018-10-24 16:30:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:03,311 INFO L93 Difference]: Finished difference Result 4874 states and 6712 transitions. [2018-10-24 16:30:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:30:03,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 183 [2018-10-24 16:30:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:03,324 INFO L225 Difference]: With dead ends: 4874 [2018-10-24 16:30:03,324 INFO L226 Difference]: Without dead ends: 2039 [2018-10-24 16:30:03,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2018-10-24 16:30:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1860. [2018-10-24 16:30:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2018-10-24 16:30:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2176 transitions. [2018-10-24 16:30:03,369 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2176 transitions. Word has length 183 [2018-10-24 16:30:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:03,370 INFO L481 AbstractCegarLoop]: Abstraction has 1860 states and 2176 transitions. [2018-10-24 16:30:03,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:30:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2176 transitions. [2018-10-24 16:30:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-24 16:30:03,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:03,379 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:03,380 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:03,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1939534344, now seen corresponding path program 1 times [2018-10-24 16:30:03,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:03,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:03,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:03,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:03,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:03,760 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:30:04,202 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-10-24 16:30:04,759 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-10-24 16:30:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 16:30:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:30:05,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:30:05,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:30:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:30:05,157 INFO L87 Difference]: Start difference. First operand 1860 states and 2176 transitions. Second operand 6 states. [2018-10-24 16:30:06,872 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 16:30:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:10,021 INFO L93 Difference]: Finished difference Result 3936 states and 4572 transitions. [2018-10-24 16:30:10,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:30:10,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 410 [2018-10-24 16:30:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:10,032 INFO L225 Difference]: With dead ends: 3936 [2018-10-24 16:30:10,032 INFO L226 Difference]: Without dead ends: 2078 [2018-10-24 16:30:10,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2018-10-24 16:30:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2039. [2018-10-24 16:30:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2018-10-24 16:30:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2356 transitions. [2018-10-24 16:30:10,072 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2356 transitions. Word has length 410 [2018-10-24 16:30:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:10,072 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 2356 transitions. [2018-10-24 16:30:10,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:30:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2356 transitions. [2018-10-24 16:30:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-24 16:30:10,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:10,084 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-24 16:30:10,085 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:10,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -441096333, now seen corresponding path program 1 times [2018-10-24 16:30:10,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:10,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 498 proven. 46 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 16:30:10,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:30:10,878 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:30:10,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:11,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:30:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 521 proven. 23 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-24 16:30:11,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:30:11,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-24 16:30:11,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:30:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:30:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:30:11,542 INFO L87 Difference]: Start difference. First operand 2039 states and 2356 transitions. Second operand 9 states. [2018-10-24 16:30:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:15,879 INFO L93 Difference]: Finished difference Result 4661 states and 5318 transitions. [2018-10-24 16:30:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:30:15,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 517 [2018-10-24 16:30:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:15,898 INFO L225 Difference]: With dead ends: 4661 [2018-10-24 16:30:15,898 INFO L226 Difference]: Without dead ends: 2803 [2018-10-24 16:30:15,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:30:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2018-10-24 16:30:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2217. [2018-10-24 16:30:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2018-10-24 16:30:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 2534 transitions. [2018-10-24 16:30:15,956 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 2534 transitions. Word has length 517 [2018-10-24 16:30:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:15,957 INFO L481 AbstractCegarLoop]: Abstraction has 2217 states and 2534 transitions. [2018-10-24 16:30:15,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:30:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2534 transitions. [2018-10-24 16:30:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-10-24 16:30:15,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:15,974 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-10-24 16:30:15,974 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:15,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1336256806, now seen corresponding path program 1 times [2018-10-24 16:30:15,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:15,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:16,462 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 16:30:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 858 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-10-24 16:30:16,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:16,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:30:16,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:30:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:30:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:16,627 INFO L87 Difference]: Start difference. First operand 2217 states and 2534 transitions. Second operand 4 states. [2018-10-24 16:30:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:17,939 INFO L93 Difference]: Finished difference Result 7117 states and 8342 transitions. [2018-10-24 16:30:17,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:17,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 623 [2018-10-24 16:30:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:17,960 INFO L225 Difference]: With dead ends: 7117 [2018-10-24 16:30:17,960 INFO L226 Difference]: Without dead ends: 5081 [2018-10-24 16:30:17,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2018-10-24 16:30:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2018-10-24 16:30:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2018-10-24 16:30:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 5657 transitions. [2018-10-24 16:30:18,045 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 5657 transitions. Word has length 623 [2018-10-24 16:30:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:18,046 INFO L481 AbstractCegarLoop]: Abstraction has 5081 states and 5657 transitions. [2018-10-24 16:30:18,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 5657 transitions. [2018-10-24 16:30:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-10-24 16:30:18,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:18,054 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:18,055 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:18,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash 246335204, now seen corresponding path program 1 times [2018-10-24 16:30:18,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:18,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 1160 proven. 156 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-10-24 16:30:19,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:30:19,279 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 16:30:19,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:30:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:19,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:30:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2018-10-24 16:30:19,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:30:19,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 16:30:19,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:30:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:30:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:30:19,887 INFO L87 Difference]: Start difference. First operand 5081 states and 5657 transitions. Second operand 6 states. [2018-10-24 16:30:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:23,216 INFO L93 Difference]: Finished difference Result 13928 states and 15907 transitions. [2018-10-24 16:30:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:30:23,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 763 [2018-10-24 16:30:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:23,246 INFO L225 Difference]: With dead ends: 13928 [2018-10-24 16:30:23,246 INFO L226 Difference]: Without dead ends: 8848 [2018-10-24 16:30:23,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:30:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8848 states. [2018-10-24 16:30:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8848 to 7403. [2018-10-24 16:30:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7403 states. [2018-10-24 16:30:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7403 states to 7403 states and 8155 transitions. [2018-10-24 16:30:23,375 INFO L78 Accepts]: Start accepts. Automaton has 7403 states and 8155 transitions. Word has length 763 [2018-10-24 16:30:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:23,380 INFO L481 AbstractCegarLoop]: Abstraction has 7403 states and 8155 transitions. [2018-10-24 16:30:23,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:30:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7403 states and 8155 transitions. [2018-10-24 16:30:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2018-10-24 16:30:23,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:23,395 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:23,395 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:23,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -127241302, now seen corresponding path program 1 times [2018-10-24 16:30:23,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:24,256 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:30:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 1621 proven. 0 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2018-10-24 16:30:25,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:25,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:30:25,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:30:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:30:25,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:30:25,198 INFO L87 Difference]: Start difference. First operand 7403 states and 8155 transitions. Second operand 6 states. [2018-10-24 16:30:25,474 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 16:30:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:28,178 INFO L93 Difference]: Finished difference Result 16777 states and 18516 transitions. [2018-10-24 16:30:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 16:30:28,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 895 [2018-10-24 16:30:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:28,219 INFO L225 Difference]: With dead ends: 16777 [2018-10-24 16:30:28,219 INFO L226 Difference]: Without dead ends: 9555 [2018-10-24 16:30:28,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:30:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2018-10-24 16:30:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 7582. [2018-10-24 16:30:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7582 states. [2018-10-24 16:30:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 8277 transitions. [2018-10-24 16:30:28,363 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 8277 transitions. Word has length 895 [2018-10-24 16:30:28,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:28,364 INFO L481 AbstractCegarLoop]: Abstraction has 7582 states and 8277 transitions. [2018-10-24 16:30:28,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:30:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 8277 transitions. [2018-10-24 16:30:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-10-24 16:30:28,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:28,383 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:28,383 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1687156824, now seen corresponding path program 1 times [2018-10-24 16:30:28,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:28,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 1796 proven. 0 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2018-10-24 16:30:29,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:29,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:30:29,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:30:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:30:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:29,693 INFO L87 Difference]: Start difference. First operand 7582 states and 8277 transitions. Second operand 4 states. [2018-10-24 16:30:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:32,231 INFO L93 Difference]: Finished difference Result 16594 states and 18219 transitions. [2018-10-24 16:30:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:32,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 928 [2018-10-24 16:30:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:32,271 INFO L225 Difference]: With dead ends: 16594 [2018-10-24 16:30:32,271 INFO L226 Difference]: Without dead ends: 9193 [2018-10-24 16:30:32,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2018-10-24 16:30:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 9193. [2018-10-24 16:30:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9193 states. [2018-10-24 16:30:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9193 states to 9193 states and 9899 transitions. [2018-10-24 16:30:32,420 INFO L78 Accepts]: Start accepts. Automaton has 9193 states and 9899 transitions. Word has length 928 [2018-10-24 16:30:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:32,422 INFO L481 AbstractCegarLoop]: Abstraction has 9193 states and 9899 transitions. [2018-10-24 16:30:32,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9193 states and 9899 transitions. [2018-10-24 16:30:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2018-10-24 16:30:32,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:32,442 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:32,442 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:32,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1348324996, now seen corresponding path program 1 times [2018-10-24 16:30:32,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:32,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:32,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:32,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3442 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2018-10-24 16:30:34,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:34,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:30:34,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:30:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:30:34,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:34,164 INFO L87 Difference]: Start difference. First operand 9193 states and 9899 transitions. Second operand 7 states. [2018-10-24 16:30:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:36,191 INFO L93 Difference]: Finished difference Result 18967 states and 20502 transitions. [2018-10-24 16:30:36,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:30:36,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1024 [2018-10-24 16:30:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:36,212 INFO L225 Difference]: With dead ends: 18967 [2018-10-24 16:30:36,212 INFO L226 Difference]: Without dead ends: 9189 [2018-10-24 16:30:36,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9189 states. [2018-10-24 16:30:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9189 to 9189. [2018-10-24 16:30:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9189 states. [2018-10-24 16:30:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9189 states to 9189 states and 9876 transitions. [2018-10-24 16:30:36,332 INFO L78 Accepts]: Start accepts. Automaton has 9189 states and 9876 transitions. Word has length 1024 [2018-10-24 16:30:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:36,333 INFO L481 AbstractCegarLoop]: Abstraction has 9189 states and 9876 transitions. [2018-10-24 16:30:36,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:30:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9189 states and 9876 transitions. [2018-10-24 16:30:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2018-10-24 16:30:36,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:36,354 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:36,354 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:36,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash -380960909, now seen corresponding path program 1 times [2018-10-24 16:30:36,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:36,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:36,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:36,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:37,379 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 16:30:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 1626 proven. 7 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2018-10-24 16:30:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:30:37,944 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:30:37,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:38,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:30:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3602 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 2694 trivial. 0 not checked. [2018-10-24 16:30:39,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:30:39,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 16:30:39,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:30:39,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:30:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:39,219 INFO L87 Difference]: Start difference. First operand 9189 states and 9876 transitions. Second operand 7 states. [2018-10-24 16:30:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:42,180 INFO L93 Difference]: Finished difference Result 20165 states and 21650 transitions. [2018-10-24 16:30:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:30:42,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1065 [2018-10-24 16:30:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:42,200 INFO L225 Difference]: With dead ends: 20165 [2018-10-24 16:30:42,201 INFO L226 Difference]: Without dead ends: 11157 [2018-10-24 16:30:42,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1082 GetRequests, 1069 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:30:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2018-10-24 16:30:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11157. [2018-10-24 16:30:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2018-10-24 16:30:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 11801 transitions. [2018-10-24 16:30:42,364 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 11801 transitions. Word has length 1065 [2018-10-24 16:30:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:42,365 INFO L481 AbstractCegarLoop]: Abstraction has 11157 states and 11801 transitions. [2018-10-24 16:30:42,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:30:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 11801 transitions. [2018-10-24 16:30:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2018-10-24 16:30:42,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:42,390 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:42,391 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:42,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1713622009, now seen corresponding path program 1 times [2018-10-24 16:30:42,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:42,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3704 backedges. 2355 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2018-10-24 16:30:43,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:30:43,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:30:43,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:30:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:30:43,822 INFO L87 Difference]: Start difference. First operand 11157 states and 11801 transitions. Second operand 5 states. [2018-10-24 16:30:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:45,370 INFO L93 Difference]: Finished difference Result 23031 states and 24363 transitions. [2018-10-24 16:30:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:30:45,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1118 [2018-10-24 16:30:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:45,391 INFO L225 Difference]: With dead ends: 23031 [2018-10-24 16:30:45,391 INFO L226 Difference]: Without dead ends: 12055 [2018-10-24 16:30:45,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:30:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2018-10-24 16:30:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11695. [2018-10-24 16:30:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2018-10-24 16:30:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 12351 transitions. [2018-10-24 16:30:45,561 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 12351 transitions. Word has length 1118 [2018-10-24 16:30:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:45,562 INFO L481 AbstractCegarLoop]: Abstraction has 11695 states and 12351 transitions. [2018-10-24 16:30:45,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:30:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 12351 transitions. [2018-10-24 16:30:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1709 [2018-10-24 16:30:45,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:45,600 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:30:45,601 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:45,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1248022839, now seen corresponding path program 1 times [2018-10-24 16:30:45,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:45,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:45,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:45,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9564 backedges. 4708 proven. 0 refuted. 0 times theorem prover too weak. 4856 trivial. 0 not checked. [2018-10-24 16:30:48,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:48,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:30:48,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:30:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:30:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:30:48,004 INFO L87 Difference]: Start difference. First operand 11695 states and 12351 transitions. Second operand 3 states. [2018-10-24 16:30:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:49,078 INFO L93 Difference]: Finished difference Result 25536 states and 26960 transitions. [2018-10-24 16:30:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:30:49,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1708 [2018-10-24 16:30:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:49,097 INFO L225 Difference]: With dead ends: 25536 [2018-10-24 16:30:49,097 INFO L226 Difference]: Without dead ends: 14022 [2018-10-24 16:30:49,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:30:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14022 states. [2018-10-24 16:30:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14022 to 12583. [2018-10-24 16:30:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12583 states. [2018-10-24 16:30:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12583 states to 12583 states and 13265 transitions. [2018-10-24 16:30:49,272 INFO L78 Accepts]: Start accepts. Automaton has 12583 states and 13265 transitions. Word has length 1708 [2018-10-24 16:30:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:49,273 INFO L481 AbstractCegarLoop]: Abstraction has 12583 states and 13265 transitions. [2018-10-24 16:30:49,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:30:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12583 states and 13265 transitions. [2018-10-24 16:30:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1773 [2018-10-24 16:30:49,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:49,314 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:49,314 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:49,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash 194212713, now seen corresponding path program 1 times [2018-10-24 16:30:49,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:49,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:49,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:49,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:49,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9766 backedges. 1463 proven. 0 refuted. 0 times theorem prover too weak. 8303 trivial. 0 not checked. [2018-10-24 16:30:52,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:30:52,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:30:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:30:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:52,439 INFO L87 Difference]: Start difference. First operand 12583 states and 13265 transitions. Second operand 7 states. [2018-10-24 16:30:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:54,581 INFO L93 Difference]: Finished difference Result 24542 states and 25895 transitions. [2018-10-24 16:30:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:30:54,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1772 [2018-10-24 16:30:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:54,591 INFO L225 Difference]: With dead ends: 24542 [2018-10-24 16:30:54,591 INFO L226 Difference]: Without dead ends: 11323 [2018-10-24 16:30:54,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:30:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11323 states. [2018-10-24 16:30:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11323 to 11323. [2018-10-24 16:30:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11323 states. [2018-10-24 16:30:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11323 states to 11323 states and 11871 transitions. [2018-10-24 16:30:54,718 INFO L78 Accepts]: Start accepts. Automaton has 11323 states and 11871 transitions. Word has length 1772 [2018-10-24 16:30:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:54,719 INFO L481 AbstractCegarLoop]: Abstraction has 11323 states and 11871 transitions. [2018-10-24 16:30:54,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:30:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11323 states and 11871 transitions. [2018-10-24 16:30:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1834 [2018-10-24 16:30:54,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:54,752 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 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, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:54,752 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:54,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -36537091, now seen corresponding path program 1 times [2018-10-24 16:30:54,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:54,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:54,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:54,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9998 backedges. 4224 proven. 0 refuted. 0 times theorem prover too weak. 5774 trivial. 0 not checked. [2018-10-24 16:30:57,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:30:57,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:30:57,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:30:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:30:57,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:57,061 INFO L87 Difference]: Start difference. First operand 11323 states and 11871 transitions. Second operand 4 states. [2018-10-24 16:30:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:58,148 INFO L93 Difference]: Finished difference Result 22465 states and 23560 transitions. [2018-10-24 16:30:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:30:58,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1833 [2018-10-24 16:30:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:58,154 INFO L225 Difference]: With dead ends: 22465 [2018-10-24 16:30:58,154 INFO L226 Difference]: Without dead ends: 4663 [2018-10-24 16:30:58,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:30:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2018-10-24 16:30:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4663. [2018-10-24 16:30:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2018-10-24 16:30:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 4779 transitions. [2018-10-24 16:30:58,265 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 4779 transitions. Word has length 1833 [2018-10-24 16:30:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:58,266 INFO L481 AbstractCegarLoop]: Abstraction has 4663 states and 4779 transitions. [2018-10-24 16:30:58,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:30:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 4779 transitions. [2018-10-24 16:30:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1906 [2018-10-24 16:30:58,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:58,290 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:58,291 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:58,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash -689251611, now seen corresponding path program 1 times [2018-10-24 16:30:58,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:58,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:58,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:58,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 1543 proven. 31 refuted. 0 times theorem prover too weak. 9766 trivial. 0 not checked. [2018-10-24 16:31:00,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:00,732 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:31:00,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:01,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:01,515 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-10-24 16:31:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 4123 proven. 295 refuted. 0 times theorem prover too weak. 6922 trivial. 0 not checked. [2018-10-24 16:31:05,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:31:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-24 16:31:05,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:31:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:31:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:05,091 INFO L87 Difference]: Start difference. First operand 4663 states and 4779 transitions. Second operand 7 states. [2018-10-24 16:31:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:09,835 INFO L93 Difference]: Finished difference Result 10397 states and 10683 transitions. [2018-10-24 16:31:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:31:09,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1905 [2018-10-24 16:31:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:09,838 INFO L225 Difference]: With dead ends: 10397 [2018-10-24 16:31:09,838 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 16:31:09,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1917 GetRequests, 1906 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-24 16:31:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 16:31:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 16:31:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 16:31:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 16:31:09,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1905 [2018-10-24 16:31:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:09,844 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 16:31:09,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:31:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 16:31:09,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 16:31:09,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 16:31:09,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:09,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:09,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,183 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 144 [2018-10-24 16:31:10,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:10,464 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 146 [2018-10-24 16:31:14,768 WARN L179 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2018-10-24 16:31:15,969 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 125 DAG size of output: 86 [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,973 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-10-24 16:31:15,974 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-24 16:31:15,975 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-24 16:31:15,976 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,977 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-10-24 16:31:15,978 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-10-24 16:31:15,979 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-10-24 16:31:15,980 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 16:31:15,981 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-24 16:31:15,982 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,983 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,984 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-10-24 16:31:15,985 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-10-24 16:31:15,986 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,987 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,988 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse3 (= ~a15~0 8)) (.cse18 (= ~a21~0 10)) (.cse12 (= ~a21~0 6)) (.cse6 (= ~a15~0 9)) (.cse23 (+ ~a12~0 43)) (.cse22 (= ~a15~0 5))) (let ((.cse9 (not .cse22)) (.cse15 (<= (+ ~a12~0 49) 0)) (.cse7 (< 80 ~a12~0)) (.cse8 (<= ~a12~0 73282)) (.cse17 (<= .cse23 0)) (.cse11 (<= ~a21~0 6)) (.cse14 (not .cse6)) (.cse2 (not .cse12)) (.cse5 (not .cse18)) (.cse19 (or (<= ~a12~0 80) (and .cse3 .cse18))) (.cse20 (not (= ~a21~0 9))) (.cse10 (not .cse3)) (.cse21 (<= ~a12~0 11)) (.cse1 (<= ~a12~0 76)) (.cse16 (= ~a21~0 8)) (.cse4 (<= 0 (+ ~a12~0 15))) (.cse0 (= ~a24~0 1))) (or (and (= ~a15~0 7) .cse0) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5) (and .cse0 .cse6 .cse7) (and .cse8 .cse9 .cse0 .cse10 .cse7 .cse11) (and .cse12 .cse3 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 299959))) (and (<= (+ .cse13 286349) ~a12~0) (= .cse13 0) (< 80 v_prenex_1))))) (and .cse14 .cse2 .cse9 .cse0 .cse10 .cse5) (and .cse14 .cse10 .cse11 .cse15 (not (= ~a15~0 6))) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse0 (= ~a21~0 7) .cse15) (and .cse8 .cse3 .cse0 .cse16 .cse7) (and .cse17 .cse3 .cse0 .cse18) (and .cse14 .cse0 .cse10 .cse4 .cse11 .cse19) (and .cse3 .cse0 .cse18 .cse7) (and .cse20 .cse0 .cse6 .cse21) (and .cse8 .cse0 .cse18 .cse22) (and .cse17 .cse3 .cse0 .cse11) (and .cse14 .cse2 .cse0 .cse10 .cse5 .cse19) (and .cse0 .cse18 .cse21 .cse4) (and .cse20 .cse0 .cse10 .cse21 (< 0 .cse23)) (and .cse1 .cse0 .cse16 .cse4) (and .cse12 .cse0 .cse22)))) [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,989 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-10-24 16:31:15,990 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse4 (= ~a15~0 8)) (.cse18 (= ~a21~0 10)) (.cse13 (= ~a21~0 6)) (.cse7 (= ~a15~0 9)) (.cse23 (+ ~a12~0 43)) (.cse22 (= ~a15~0 5))) (let ((.cse10 (not .cse22)) (.cse1 (<= (+ ~a12~0 49) 0)) (.cse8 (< 80 ~a12~0)) (.cse9 (<= ~a12~0 73282)) (.cse17 (<= .cse23 0)) (.cse12 (<= ~a21~0 6)) (.cse15 (not .cse7)) (.cse3 (not .cse13)) (.cse6 (not .cse18)) (.cse19 (or (<= ~a12~0 80) (and .cse4 .cse18))) (.cse20 (not (= ~a21~0 9))) (.cse11 (not .cse4)) (.cse21 (<= ~a12~0 11)) (.cse2 (<= ~a12~0 76)) (.cse16 (= ~a21~0 8)) (.cse5 (<= 0 (+ ~a12~0 15))) (.cse0 (= ~a24~0 1))) (or (and .cse0 (= ~a21~0 7) .cse1) (and (= ~a15~0 7) .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse8 .cse12) (and .cse13 .cse4 .cse0 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 299959))) (and (<= (+ .cse14 286349) ~a12~0) (= .cse14 0) (< 80 v_prenex_1))))) (and .cse15 .cse3 .cse10 .cse0 .cse11 .cse6) (and .cse15 .cse11 .cse12 .cse1 (not (= ~a15~0 6))) (and .cse9 .cse4 .cse0 .cse16 .cse8) (and .cse17 .cse4 .cse0 .cse18) (and .cse15 .cse0 .cse11 .cse5 .cse12 .cse19) (and .cse4 .cse0 .cse18 .cse8) (and .cse20 .cse0 .cse7 .cse21) (and .cse9 .cse0 .cse18 .cse22) (and .cse17 .cse4 .cse0 .cse12) (and .cse15 .cse3 .cse0 .cse11 .cse6 .cse19) (and .cse0 .cse18 .cse21 .cse5) (and .cse20 .cse0 .cse11 .cse21 (< 0 .cse23)) (and .cse2 .cse0 .cse16 .cse5) (and .cse13 .cse0 .cse22)))) [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-10-24 16:31:15,991 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-10-24 16:31:15,992 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,993 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,994 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,995 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:15,996 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-10-24 16:31:15,996 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-24 16:31:15,996 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-24 16:31:15,996 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 16:31:15,996 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-10-24 16:31:16,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,018 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,027 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,027 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,028 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:31:16 BoogieIcfgContainer [2018-10-24 16:31:16,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:31:16,033 INFO L168 Benchmark]: Toolchain (without parser) took 94447.02 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,034 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:31:16,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.31 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,039 INFO L168 Benchmark]: Boogie Preprocessor took 100.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,040 INFO L168 Benchmark]: RCFGBuilder took 3447.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,041 INFO L168 Benchmark]: TraceAbstraction took 89971.98 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -874.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:16,046 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.31 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 195.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.72 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3447.25 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89971.98 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -874.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2018-10-24 16:31:16,056 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,057 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,059 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,059 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,060 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a24 == 1 && a21 == 7) && a12 + 49 <= 0) || (a15 == 7 && a24 == 1)) || (((((a12 <= 76 && !(a21 == 6)) && a15 == 8) && a24 == 1) && 0 <= a12 + 15) && !(a21 == 10))) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && 80 < a12) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && a24 == 1) && (\exists v_prenex_1 : int :: (v_prenex_1 % 299959 + 286349 <= a12 && v_prenex_1 % 299959 == 0) && 80 < v_prenex_1))) || (((((!(a15 == 9) && !(a21 == 6)) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10))) || ((((!(a15 == 9) && !(a15 == 8)) && a21 <= 6) && a12 + 49 <= 0) && !(a15 == 6))) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || (((((!(a15 == 9) && a24 == 1) && !(a15 == 8)) && 0 <= a12 + 15) && a21 <= 6) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((!(a21 == 9) && a24 == 1) && a15 == 9) && a12 <= 11)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 <= 6)) || (((((!(a15 == 9) && !(a21 == 6)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10)) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 <= a12 + 15)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 0 <= a12 + 15)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 20]: Loop Invariant [2018-10-24 16:31:16,062 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,062 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,062 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,064 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,065 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-10-24 16:31:16,065 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a15 == 7 && a24 == 1) || (((((a12 <= 76 && !(a21 == 6)) && a15 == 8) && a24 == 1) && 0 <= a12 + 15) && !(a21 == 10))) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((((a12 <= 73282 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && 80 < a12) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && a24 == 1) && (\exists v_prenex_1 : int :: (v_prenex_1 % 299959 + 286349 <= a12 && v_prenex_1 % 299959 == 0) && 80 < v_prenex_1))) || (((((!(a15 == 9) && !(a21 == 6)) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10))) || ((((!(a15 == 9) && !(a15 == 8)) && a21 <= 6) && a12 + 49 <= 0) && !(a15 == 6))) || (((!(input == 5) && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 == 10)) || (((((!(a15 == 9) && a24 == 1) && !(a15 == 8)) && 0 <= a12 + 15) && a21 <= 6) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a15 == 8 && a24 == 1) && a21 == 10) && 80 < a12)) || (((!(a21 == 9) && a24 == 1) && a15 == 9) && a12 <= 11)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || (((a12 + 43 <= 0 && a15 == 8) && a24 == 1) && a21 <= 6)) || (((((!(a15 == 9) && !(a21 == 6)) && a24 == 1) && !(a15 == 8)) && !(a21 == 10)) && (a12 <= 80 || (a15 == 8 && a21 == 10)))) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 <= a12 + 15)) || ((((!(a21 == 9) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && 0 < a12 + 43)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 0 <= a12 + 15)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 89.8s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 50.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2105 SDtfs, 10825 SDslu, 1713 SDs, 0 SdLazy, 25103 SolverSat, 3102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4362 GetRequests, 4275 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12583occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 6021 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 176 NumberOfFragments, 713 HoareAnnotationTreeSize, 3 FomulaSimplifications, 22155 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2562 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 19310 NumberOfCodeBlocks, 19310 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 19289 ConstructedInterpolants, 257 QuantifiedInterpolants, 57326128 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5173 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 77709/78267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...